./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:38:56,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:38:56,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:38:56,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:38:56,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:38:56,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:38:56,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:38:56,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:38:56,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:38:56,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:38:56,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:38:56,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:38:56,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:38:56,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:38:56,935 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:38:56,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:38:56,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:38:56,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:38:56,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:38:56,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:38:56,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:38:56,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:38:56,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:38:56,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:38:56,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:38:56,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:38:56,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:38:56,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:38:56,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:38:56,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:38:56,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:38:56,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:38:56,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:38:56,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:38:56,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:38:56,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:38:56,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:38:56,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:38:56,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:38:56,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:38:56,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:38:56,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:38:56,948 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-clean/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-clean/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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2024-10-11 01:38:57,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:38:57,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:38:57,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:38:57,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:38:57,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:38:57,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-10-11 01:38:58,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:38:58,977 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:38:58,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-10-11 01:38:58,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07c302781/097293f58e014ca88ae8faa5caf152f8/FLAGc8a23a31f [2024-10-11 01:38:59,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07c302781/097293f58e014ca88ae8faa5caf152f8 [2024-10-11 01:38:59,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:38:59,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:38:59,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:38:59,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:38:59,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:38:59,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77071d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59, skipping insertion in model container [2024-10-11 01:38:59,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:38:59,389 WARN L248 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-01-1.i[22034,22047] [2024-10-11 01:38:59,398 WARN L248 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-01-1.i[22307,22320] [2024-10-11 01:38:59,402 WARN L248 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-01-1.i[22516,22529] [2024-10-11 01:38:59,403 WARN L248 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-01-1.i[22586,22599] [2024-10-11 01:38:59,406 WARN L248 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-01-1.i[22853,22866] [2024-10-11 01:38:59,407 WARN L248 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-01-1.i[22961,22974] [2024-10-11 01:38:59,408 WARN L248 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-01-1.i[23192,23205] [2024-10-11 01:38:59,409 WARN L248 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-01-1.i[23272,23285] [2024-10-11 01:38:59,410 WARN L248 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-01-1.i[23351,23364] [2024-10-11 01:38:59,411 WARN L248 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-01-1.i[23441,23454] [2024-10-11 01:38:59,412 WARN L248 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-01-1.i[23619,23632] [2024-10-11 01:38:59,413 WARN L248 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-01-1.i[23697,23710] [2024-10-11 01:38:59,414 WARN L248 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-01-1.i[23774,23787] [2024-10-11 01:38:59,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:38:59,427 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:38:59,476 WARN L248 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-01-1.i[22034,22047] [2024-10-11 01:38:59,480 WARN L248 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-01-1.i[22307,22320] [2024-10-11 01:38:59,481 WARN L248 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-01-1.i[22516,22529] [2024-10-11 01:38:59,482 WARN L248 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-01-1.i[22586,22599] [2024-10-11 01:38:59,484 WARN L248 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-01-1.i[22853,22866] [2024-10-11 01:38:59,486 WARN L248 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-01-1.i[22961,22974] [2024-10-11 01:38:59,487 WARN L248 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-01-1.i[23192,23205] [2024-10-11 01:38:59,488 WARN L248 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-01-1.i[23272,23285] [2024-10-11 01:38:59,489 WARN L248 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-01-1.i[23351,23364] [2024-10-11 01:38:59,490 WARN L248 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-01-1.i[23441,23454] [2024-10-11 01:38:59,492 WARN L248 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-01-1.i[23619,23632] [2024-10-11 01:38:59,493 WARN L248 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-01-1.i[23697,23710] [2024-10-11 01:38:59,494 WARN L248 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-01-1.i[23774,23787] [2024-10-11 01:38:59,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:38:59,525 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:38:59,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59 WrapperNode [2024-10-11 01:38:59,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:38:59,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:38:59,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:38:59,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:38:59,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,571 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-10-11 01:38:59,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:38:59,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:38:59,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:38:59,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:38:59,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,611 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-10-11 01:38:59,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:38:59,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:38:59,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:38:59,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:38:59,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (1/1) ... [2024-10-11 01:38:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:38:59,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:38:59,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:38:59,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:38:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:38:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:38:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:38:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:38:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:38:59,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:38:59,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:39:00,218 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 01:39:00,219 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:39:00,241 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:39:00,242 INFO L314 CfgBuilder]: Removed 30 assume(true) statements. [2024-10-11 01:39:00,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:00 BoogieIcfgContainer [2024-10-11 01:39:00,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:39:00,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:39:00,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:39:00,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:39:00,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:38:59" (1/3) ... [2024-10-11 01:39:00,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f222f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:00, skipping insertion in model container [2024-10-11 01:39:00,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:59" (2/3) ... [2024-10-11 01:39:00,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f222f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:00, skipping insertion in model container [2024-10-11 01:39:00,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:00" (3/3) ... [2024-10-11 01:39:00,255 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2024-10-11 01:39:00,273 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:39:00,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 01:39:00,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:39:00,350 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;@12b41cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:39:00,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 01:39:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 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-10-11 01:39:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 01:39:00,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:00,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 01:39:00,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:00,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 348139, now seen corresponding path program 1 times [2024-10-11 01:39:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232068241] [2024-10-11 01:39:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232068241] [2024-10-11 01:39:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232068241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:00,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:39:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694843525] [2024-10-11 01:39:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:00,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:00,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:00,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:00,656 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-11 01:39:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:00,762 INFO L93 Difference]: Finished difference Result 175 states and 291 transitions. [2024-10-11 01:39:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-11 01:39:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:00,775 INFO L225 Difference]: With dead ends: 175 [2024-10-11 01:39:00,776 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 01:39:00,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 01:39:00,783 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:00,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 93 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 01:39:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-10-11 01:39:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 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-10-11 01:39:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-10-11 01:39:00,828 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 3 [2024-10-11 01:39:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:00,828 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-10-11 01:39:00,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-11 01:39:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-10-11 01:39:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:00,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:00,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:39:00,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:00,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -85138699, now seen corresponding path program 1 times [2024-10-11 01:39:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111828563] [2024-10-11 01:39:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111828563] [2024-10-11 01:39:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111828563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354478711] [2024-10-11 01:39:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:01,140 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:01,292 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-10-11 01:39:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:39:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:01,295 INFO L225 Difference]: With dead ends: 200 [2024-10-11 01:39:01,295 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 01:39:01,295 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-10-11 01:39:01,298 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:01,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 01:39:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 78. [2024-10-11 01:39:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 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-10-11 01:39:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-10-11 01:39:01,317 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 9 [2024-10-11 01:39:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-10-11 01:39:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-10-11 01:39:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:01,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:01,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:39:01,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:01,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -85136777, now seen corresponding path program 1 times [2024-10-11 01:39:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112454478] [2024-10-11 01:39:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:01,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112454478] [2024-10-11 01:39:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112454478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208017598] [2024-10-11 01:39:01,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:01,526 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:01,658 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2024-10-11 01:39:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:39:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:01,660 INFO L225 Difference]: With dead ends: 132 [2024-10-11 01:39:01,660 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 01:39:01,660 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-10-11 01:39:01,661 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:01,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 198 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 01:39:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 79. [2024-10-11 01:39:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 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-10-11 01:39:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-11 01:39:01,674 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 9 [2024-10-11 01:39:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-11 01:39:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-10-11 01:39:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:01,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:01,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:01,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:39:01,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -83289735, now seen corresponding path program 1 times [2024-10-11 01:39:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762123379] [2024-10-11 01:39:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762123379] [2024-10-11 01:39:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762123379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832475602] [2024-10-11 01:39:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:01,934 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,007 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-10-11 01:39:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:39:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,009 INFO L225 Difference]: With dead ends: 79 [2024-10-11 01:39:02,010 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 01:39:02,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:02,012 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 01:39:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-11 01:39:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 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-10-11 01:39:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-10-11 01:39:02,028 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2024-10-11 01:39:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,028 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-10-11 01:39:02,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-11 01:39:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-10-11 01:39:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:39:02,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:39:02,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -198671904, now seen corresponding path program 1 times [2024-10-11 01:39:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525622693] [2024-10-11 01:39:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525622693] [2024-10-11 01:39:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525622693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805419002] [2024-10-11 01:39:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:02,079 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-10-11 01:39:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,135 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-10-11 01:39:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-11 01:39:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,136 INFO L225 Difference]: With dead ends: 79 [2024-10-11 01:39:02,136 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 01:39:02,137 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-10-11 01:39:02,138 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 01:39:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-10-11 01:39:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 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-10-11 01:39:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-10-11 01:39:02,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 14 [2024-10-11 01:39:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,154 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-10-11 01:39:02,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-10-11 01:39:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-10-11 01:39:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:39:02,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1863857528, now seen corresponding path program 1 times [2024-10-11 01:39:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492538053] [2024-10-11 01:39:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492538053] [2024-10-11 01:39:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492538053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648594389] [2024-10-11 01:39:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:02,227 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,313 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-10-11 01:39:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:39:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,315 INFO L225 Difference]: With dead ends: 131 [2024-10-11 01:39:02,315 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 01:39:02,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 01:39:02,317 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 112 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 01:39:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2024-10-11 01:39:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-11 01:39:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-10-11 01:39:02,334 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2024-10-11 01:39:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-10-11 01:39:02,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-10-11 01:39:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:39:02,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:39:02,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -219174669, now seen corresponding path program 1 times [2024-10-11 01:39:02,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829108249] [2024-10-11 01:39:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829108249] [2024-10-11 01:39:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829108249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905286094] [2024-10-11 01:39:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:02,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:02,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:02,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:02,390 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-11 01:39:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,407 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2024-10-11 01:39:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-11 01:39:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,408 INFO L225 Difference]: With dead ends: 117 [2024-10-11 01:39:02,408 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 01:39:02,409 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-10-11 01:39:02,409 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 01:39:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-11 01:39:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 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-10-11 01:39:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-11 01:39:02,418 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 19 [2024-10-11 01:39:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-11 01:39:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-11 01:39:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-11 01:39:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:39:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:39:02,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1795515351, now seen corresponding path program 1 times [2024-10-11 01:39:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623060283] [2024-10-11 01:39:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623060283] [2024-10-11 01:39:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623060283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642632967] [2024-10-11 01:39:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:02,458 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-11 01:39:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,477 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-10-11 01:39:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-11 01:39:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,479 INFO L225 Difference]: With dead ends: 74 [2024-10-11 01:39:02,479 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 01:39:02,479 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-10-11 01:39:02,483 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 01:39:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 01:39:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 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-10-11 01:39:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-11 01:39:02,494 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 20 [2024-10-11 01:39:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,494 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-11 01:39:02,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-11 01:39:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-11 01:39:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 01:39:02,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 01:39:02,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1692801264, now seen corresponding path program 1 times [2024-10-11 01:39:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208168798] [2024-10-11 01:39:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208168798] [2024-10-11 01:39:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208168798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:02,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607817348] [2024-10-11 01:39:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:02,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:02,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:02,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:02,632 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:02,702 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-10-11 01:39:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:39:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 01:39:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:02,703 INFO L225 Difference]: With dead ends: 73 [2024-10-11 01:39:02,703 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 01:39:02,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:02,704 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:02,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 01:39:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-11 01:39:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.25) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-11 01:39:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-10-11 01:39:02,722 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 22 [2024-10-11 01:39:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:02,722 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-10-11 01:39:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-10-11 01:39:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:39:02,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:02,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:02,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 01:39:02,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 679211624, now seen corresponding path program 1 times [2024-10-11 01:39:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:02,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230934967] [2024-10-11 01:39:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230934967] [2024-10-11 01:39:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230934967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412636695] [2024-10-11 01:39:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:03,010 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-11 01:39:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:03,213 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2024-10-11 01:39:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:39:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 01:39:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:03,215 INFO L225 Difference]: With dead ends: 198 [2024-10-11 01:39:03,215 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 01:39:03,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:39:03,218 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 135 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:03,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 257 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 01:39:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2024-10-11 01:39:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 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-10-11 01:39:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-10-11 01:39:03,233 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 23 [2024-10-11 01:39:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:03,235 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-10-11 01:39:03,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-11 01:39:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-10-11 01:39:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:39:03,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:03,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:03,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 01:39:03,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:03,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 578615784, now seen corresponding path program 1 times [2024-10-11 01:39:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834206274] [2024-10-11 01:39:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834206274] [2024-10-11 01:39:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834206274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:03,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:39:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661124430] [2024-10-11 01:39:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:03,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:39:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:39:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:39:03,852 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-11 01:39:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:04,250 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2024-10-11 01:39:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:39:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 01:39:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:04,253 INFO L225 Difference]: With dead ends: 195 [2024-10-11 01:39:04,253 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 01:39:04,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:39:04,255 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 193 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:04,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 383 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 01:39:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2024-10-11 01:39:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 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-10-11 01:39:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2024-10-11 01:39:04,279 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 23 [2024-10-11 01:39:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:04,279 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2024-10-11 01:39:04,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-11 01:39:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2024-10-11 01:39:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:39:04,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:04,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 01:39:04,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:04,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash -751953218, now seen corresponding path program 1 times [2024-10-11 01:39:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637707024] [2024-10-11 01:39:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:39:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637707024] [2024-10-11 01:39:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637707024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071399892] [2024-10-11 01:39:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:04,390 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:04,496 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2024-10-11 01:39:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:39:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 01:39:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:04,497 INFO L225 Difference]: With dead ends: 154 [2024-10-11 01:39:04,497 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 01:39:04,498 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-10-11 01:39:04,498 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:04,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 186 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 01:39:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2024-10-11 01:39:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 128 states have internal predecessors, (152), 0 states have call successors, (0), 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-10-11 01:39:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2024-10-11 01:39:04,520 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 25 [2024-10-11 01:39:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2024-10-11 01:39:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2024-10-11 01:39:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:39:04,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:04,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:04,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 01:39:04,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1359692350, now seen corresponding path program 1 times [2024-10-11 01:39:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668950895] [2024-10-11 01:39:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:39:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668950895] [2024-10-11 01:39:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668950895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940330471] [2024-10-11 01:39:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:04,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:04,568 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:04,629 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2024-10-11 01:39:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:04,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 01:39:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:04,631 INFO L225 Difference]: With dead ends: 129 [2024-10-11 01:39:04,631 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 01:39:04,631 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-10-11 01:39:04,633 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:04,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 74 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 01:39:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 01:39:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 126 states have internal predecessors, (150), 0 states have call successors, (0), 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-10-11 01:39:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-10-11 01:39:04,662 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 25 [2024-10-11 01:39:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:04,663 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-10-11 01:39:04,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-10-11 01:39:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:39:04,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:04,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 01:39:04,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1843174537, now seen corresponding path program 1 times [2024-10-11 01:39:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31568739] [2024-10-11 01:39:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:05,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31568739] [2024-10-11 01:39:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31568739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:39:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793296497] [2024-10-11 01:39:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:05,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:39:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:39:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:39:05,326 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:05,678 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2024-10-11 01:39:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:39:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 01:39:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:05,680 INFO L225 Difference]: With dead ends: 212 [2024-10-11 01:39:05,680 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 01:39:05,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:39:05,681 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 191 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:05,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 339 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 01:39:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 130. [2024-10-11 01:39:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.224) internal successors, (153), 129 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-11 01:39:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2024-10-11 01:39:05,700 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 26 [2024-10-11 01:39:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:05,701 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2024-10-11 01:39:05,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-10-11 01:39:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:39:05,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:05,702 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, 1, 1, 1, 1] [2024-10-11 01:39:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 01:39:05,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1835173535, now seen corresponding path program 1 times [2024-10-11 01:39:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550778560] [2024-10-11 01:39:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550778560] [2024-10-11 01:39:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550778560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105560527] [2024-10-11 01:39:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:05,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:05,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:05,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:05,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:39:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:05,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:39:05,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:06,018 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-10-11 01:39:06,027 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-10-11 01:39:06,084 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 11 [2024-10-11 01:39:06,094 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 19 treesize of output 18 [2024-10-11 01:39:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:06,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105560527] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:06,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2024-10-11 01:39:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753051171] [2024-10-11 01:39:06,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:06,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:39:06,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:39:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:39:06,348 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:06,559 INFO L93 Difference]: Finished difference Result 214 states and 247 transitions. [2024-10-11 01:39:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:06,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 01:39:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:06,561 INFO L225 Difference]: With dead ends: 214 [2024-10-11 01:39:06,561 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 01:39:06,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:39:06,562 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 140 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:06,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 213 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 01:39:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2024-10-11 01:39:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.204724409448819) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-11 01:39:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2024-10-11 01:39:06,586 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 28 [2024-10-11 01:39:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:06,586 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2024-10-11 01:39:06,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2024-10-11 01:39:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:39:06,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:06,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:06,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:39:06,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 01:39:06,788 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:06,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 762414011, now seen corresponding path program 1 times [2024-10-11 01:39:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302319976] [2024-10-11 01:39:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302319976] [2024-10-11 01:39:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302319976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:07,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:07,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:39:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478379798] [2024-10-11 01:39:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:07,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:39:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:39:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:39:07,068 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 01:39:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:07,375 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2024-10-11 01:39:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 01:39:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-10-11 01:39:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:07,377 INFO L225 Difference]: With dead ends: 199 [2024-10-11 01:39:07,377 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 01:39:07,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:39:07,378 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 278 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:07,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 333 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 01:39:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2024-10-11 01:39:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 130 states have internal predecessors, (151), 0 states have call successors, (0), 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-10-11 01:39:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2024-10-11 01:39:07,400 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 28 [2024-10-11 01:39:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2024-10-11 01:39:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 01:39:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2024-10-11 01:39:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 01:39:07,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:07,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:07,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 01:39:07,401 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:07,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -984027121, now seen corresponding path program 1 times [2024-10-11 01:39:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074105699] [2024-10-11 01:39:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:07,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:07,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074105699] [2024-10-11 01:39:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074105699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:07,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:07,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384010187] [2024-10-11 01:39:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:07,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:07,443 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-11 01:39:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:07,481 INFO L93 Difference]: Finished difference Result 218 states and 256 transitions. [2024-10-11 01:39:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-10-11 01:39:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:07,483 INFO L225 Difference]: With dead ends: 218 [2024-10-11 01:39:07,483 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 01:39:07,483 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-10-11 01:39:07,484 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:07,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 01:39:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2024-10-11 01:39:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 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-10-11 01:39:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2024-10-11 01:39:07,511 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 30 [2024-10-11 01:39:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:07,512 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2024-10-11 01:39:07,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-11 01:39:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2024-10-11 01:39:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 01:39:07,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:07,513 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 01:39:07,513 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 536850794, now seen corresponding path program 1 times [2024-10-11 01:39:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973328492] [2024-10-11 01:39:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973328492] [2024-10-11 01:39:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973328492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954103128] [2024-10-11 01:39:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:07,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:07,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:07,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:07,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:39:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:07,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 01:39:07,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:07,795 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-10-11 01:39:07,800 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-10-11 01:39:07,828 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 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 01:39:07,837 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 27 treesize of output 11 [2024-10-11 01:39:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:39:07,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:39:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954103128] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:08,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 7 [2024-10-11 01:39:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000246000] [2024-10-11 01:39:08,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:39:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:39:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:39:08,060 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-10-11 01:39:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:08,300 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2024-10-11 01:39:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:39:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 31 [2024-10-11 01:39:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:08,302 INFO L225 Difference]: With dead ends: 278 [2024-10-11 01:39:08,302 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 01:39:08,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:39:08,303 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 107 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:08,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 342 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 01:39:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 181. [2024-10-11 01:39:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.2329545454545454) internal successors, (217), 180 states have internal predecessors, (217), 0 states have call successors, (0), 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-10-11 01:39:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2024-10-11 01:39:08,350 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 31 [2024-10-11 01:39:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:08,350 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2024-10-11 01:39:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-10-11 01:39:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2024-10-11 01:39:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 01:39:08,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:08,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1] [2024-10-11 01:39:08,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:39:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 01:39:08,552 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1948386110, now seen corresponding path program 1 times [2024-10-11 01:39:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:08,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014440585] [2024-10-11 01:39:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014440585] [2024-10-11 01:39:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014440585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116118189] [2024-10-11 01:39:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:39:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:39:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:08,658 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-10-11 01:39:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:08,749 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2024-10-11 01:39:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:39:08,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 01:39:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:08,751 INFO L225 Difference]: With dead ends: 247 [2024-10-11 01:39:08,751 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 01:39:08,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:08,752 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:08,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 01:39:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-10-11 01:39:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1640625) internal successors, (149), 131 states have internal predecessors, (149), 0 states have call successors, (0), 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-10-11 01:39:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-10-11 01:39:08,775 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 34 [2024-10-11 01:39:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:08,776 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-10-11 01:39:08,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-10-11 01:39:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-10-11 01:39:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:39:08,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:08,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:08,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 01:39:08,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1936567885, now seen corresponding path program 1 times [2024-10-11 01:39:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568046331] [2024-10-11 01:39:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568046331] [2024-10-11 01:39:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568046331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:08,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471702841] [2024-10-11 01:39:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:39:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:39:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:08,988 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:09,108 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2024-10-11 01:39:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:39:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 01:39:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:09,110 INFO L225 Difference]: With dead ends: 218 [2024-10-11 01:39:09,110 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 01:39:09,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:39:09,111 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:09,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 214 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 01:39:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2024-10-11 01:39:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.1615384615384616) internal successors, (151), 133 states have internal predecessors, (151), 0 states have call successors, (0), 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-10-11 01:39:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-10-11 01:39:09,134 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 35 [2024-10-11 01:39:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:09,134 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-10-11 01:39:09,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-10-11 01:39:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:39:09,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:09,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:09,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 01:39:09,136 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1337331057, now seen corresponding path program 1 times [2024-10-11 01:39:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:09,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981384554] [2024-10-11 01:39:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981384554] [2024-10-11 01:39:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981384554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920741784] [2024-10-11 01:39:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:10,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:10,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:39:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:10,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 01:39:10,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:10,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:39:10,219 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-10-11 01:39:10,225 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-10-11 01:39:10,376 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:39:10,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 01:39:10,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,395 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 01:39:10,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,403 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 01:39:10,409 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-10-11 01:39:10,417 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-10-11 01:39:10,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,680 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-10-11 01:39:10,681 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 122 [2024-10-11 01:39:10,701 INFO L349 Elim1Store]: treesize reduction 179, result has 0.6 percent of original size [2024-10-11 01:39:10,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 350 treesize of output 237 [2024-10-11 01:39:10,714 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 77 treesize of output 63 [2024-10-11 01:39:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,732 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 01:39:10,732 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 115 [2024-10-11 01:39:10,775 INFO L349 Elim1Store]: treesize reduction 98, result has 10.1 percent of original size [2024-10-11 01:39:10,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 296 treesize of output 225 [2024-10-11 01:39:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 179 [2024-10-11 01:39:10,809 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 145 treesize of output 131 [2024-10-11 01:39:10,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:10,873 INFO L349 Elim1Store]: treesize reduction 69, result has 38.4 percent of original size [2024-10-11 01:39:10,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 189 [2024-10-11 01:39:10,908 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2024-10-11 01:39:10,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2024-10-11 01:39:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:12,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:12,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:12,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 140 treesize of output 153 [2024-10-11 01:39:12,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:12,367 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 145 treesize of output 146 [2024-10-11 01:39:12,416 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-11 01:39:13,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,070 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 2 case distinctions, treesize of input 58 treesize of output 51 [2024-10-11 01:39:13,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1311 treesize of output 1065 [2024-10-11 01:39:13,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,118 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 590 treesize of output 492 [2024-10-11 01:39:13,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,134 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 475 treesize of output 433 [2024-10-11 01:39:13,144 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 425 treesize of output 369 [2024-10-11 01:39:13,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,283 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 2 case distinctions, treesize of input 78 treesize of output 71 [2024-10-11 01:39:13,289 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,296 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 2 case distinctions, treesize of input 52 treesize of output 58 [2024-10-11 01:39:13,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 81 [2024-10-11 01:39:13,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 260 [2024-10-11 01:39:13,329 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 148 treesize of output 134 [2024-10-11 01:39:13,337 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 194 treesize of output 170 [2024-10-11 01:39:13,345 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 191 treesize of output 169 [2024-10-11 01:39:13,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:13,360 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 158 treesize of output 156 [2024-10-11 01:39:13,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,384 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 15 treesize of output 9 [2024-10-11 01:39:13,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:13,416 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 15 treesize of output 9 [2024-10-11 01:39:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920741784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:13,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-10-11 01:39:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395352993] [2024-10-11 01:39:13,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:39:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:39:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=297, Unknown=7, NotChecked=0, Total=380 [2024-10-11 01:39:13,644 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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-10-11 01:39:18,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:39:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:32,264 INFO L93 Difference]: Finished difference Result 389 states and 434 transitions. [2024-10-11 01:39:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 01:39:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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 35 [2024-10-11 01:39:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:32,269 INFO L225 Difference]: With dead ends: 389 [2024-10-11 01:39:32,269 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 01:39:32,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=281, Invalid=823, Unknown=18, NotChecked=0, Total=1122 [2024-10-11 01:39:32,270 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 483 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:32,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 998 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 646 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 01:39:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 01:39:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 136. [2024-10-11 01:39:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-11 01:39:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2024-10-11 01:39:32,305 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 35 [2024-10-11 01:39:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:32,306 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2024-10-11 01:39:32,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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-10-11 01:39:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2024-10-11 01:39:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:39:32,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:32,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:32,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:39:32,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:32,507 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-11 01:39:32,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1048858225, now seen corresponding path program 1 times [2024-10-11 01:39:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648037537] [2024-10-11 01:39:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648037537] [2024-10-11 01:39:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648037537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599999612] [2024-10-11 01:39:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:33,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:33,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:39:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:33,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 01:39:33,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:33,518 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:39:33,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 172 [2024-10-11 01:39:33,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:33,569 INFO L349 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2024-10-11 01:39:33,569 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 84 [2024-10-11 01:39:33,691 INFO L349 Elim1Store]: treesize reduction 206, result has 24.5 percent of original size [2024-10-11 01:39:33,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 232 treesize of output 364 [2024-10-11 01:39:33,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:33,768 INFO L349 Elim1Store]: treesize reduction 96, result has 15.8 percent of original size [2024-10-11 01:39:33,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 348 treesize of output 252 [2024-10-11 01:39:33,800 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 01:39:33,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 01:39:33,991 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 0 case distinctions, treesize of input 174 treesize of output 146 [2024-10-11 01:39:34,019 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 01:39:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 01:39:34,037 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-10-11 01:39:34,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 98 [2024-10-11 01:39:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:34,299 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:39:34,299 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2024-10-11 01:39:34,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:34,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-10-11 01:39:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:34,326 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-11 01:39:34,327 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 66 treesize of output 57 [2024-10-11 01:39:34,346 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:39:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 01:39:34,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 35 [2024-10-11 01:39:34,605 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 01:39:34,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 88 [2024-10-11 01:39:34,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:34,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2024-10-11 01:39:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:35,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:35,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4) 0))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) (and (forall ((v_ArrVal_704 (Array Int Int))) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) .cse2) 0)) (forall ((v_ArrVal_704 (Array Int Int))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_704))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) .cse2) 0))))) is different from false [2024-10-11 01:39:35,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:35,323 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 118 treesize of output 116 [2024-10-11 01:39:36,279 INFO L349 Elim1Store]: treesize reduction 42, result has 62.8 percent of original size [2024-10-11 01:39:36,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 21858 treesize of output 16261 [2024-10-11 01:39:37,491 INFO L349 Elim1Store]: treesize reduction 837, result has 21.5 percent of original size [2024-10-11 01:39:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 46 case distinctions, treesize of input 102220 treesize of output 88126 [2024-10-11 01:39:48,133 WARN L286 SmtUtils]: Spent 9.17s on a formula simplification. DAG size of input: 752 DAG size of output: 334 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-11 01:39:48,133 INFO L349 Elim1Store]: treesize reduction 7973, result has 20.8 percent of original size [2024-10-11 01:39:48,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 17 new quantified variables, introduced 108 case distinctions, treesize of input 729936 treesize of output 296883 [2024-10-11 01:39:52,229 INFO L349 Elim1Store]: treesize reduction 2024, result has 11.3 percent of original size [2024-10-11 01:39:52,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 41 case distinctions, treesize of input 44311 treesize of output 44175 [2024-10-11 01:39:54,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:54,515 INFO L349 Elim1Store]: treesize reduction 17, result has 91.0 percent of original size [2024-10-11 01:39:54,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38873 treesize of output 33910 [2024-10-11 01:39:57,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:57,539 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 18590 treesize of output 18040 [2024-10-11 01:40:05,978 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 1994 DAG size of output: 2246 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 01:40:09,231 INFO L349 Elim1Store]: treesize reduction 1127, result has 23.4 percent of original size [2024-10-11 01:40:09,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 48 case distinctions, treesize of input 15243 treesize of output 15286 [2024-10-11 01:40:11,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:11,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:11,348 INFO L349 Elim1Store]: treesize reduction 17, result has 83.5 percent of original size [2024-10-11 01:40:11,349 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 5 new quantified variables, introduced 12 case distinctions, treesize of input 11238 treesize of output 10816 [2024-10-11 01:40:12,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:12,562 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 9957 treesize of output 9645 [2024-10-11 01:40:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:13,552 INFO L349 Elim1Store]: treesize reduction 17, result has 82.5 percent of original size [2024-10-11 01:40:13,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 8908 treesize of output 8147 [2024-10-11 01:40:14,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:14,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 298 treesize of output 444