./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd --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.3.0-dev-826ab2b [2024-11-13 13:01:39,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:01:39,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:01:39,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:01:39,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:01:39,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:01:39,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:01:39,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:01:39,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:01:39,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:01:39,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:01:39,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:01:39,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:01:39,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:01:39,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:01:39,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:01:39,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:01:39,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:01:39,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:01:39,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:01:39,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:01:39,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:01:39,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:01:39,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:01:39,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:01:39,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:01:39,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:01:39,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:01:39,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:01:39,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd 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-11-13 13:01:39,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:01:39,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:01:39,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:01:39,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:01:39,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:01:39,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/sll-01-1.i Unable to find full path for "g++" [2024-11-13 13:01:41,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:01:41,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:01:41,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-13 13:01:41,986 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/data/bde7470ee/721c593a13c143b3a5f21de413444501/FLAGbe4799c35 [2024-11-13 13:01:42,009 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/data/bde7470ee/721c593a13c143b3a5f21de413444501 [2024-11-13 13:01:42,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:01:42,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:01:42,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:01:42,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:01:42,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:01:42,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b963da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42, skipping insertion in model container [2024-11-13 13:01:42,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:01:42,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2024-11-13 13:01:42,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2024-11-13 13:01:42,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2024-11-13 13:01:42,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2024-11-13 13:01:42,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2024-11-13 13:01:42,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2024-11-13 13:01:42,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2024-11-13 13:01:42,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2024-11-13 13:01:42,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2024-11-13 13:01:42,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2024-11-13 13:01:42,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2024-11-13 13:01:42,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2024-11-13 13:01:42,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2024-11-13 13:01:42,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:01:42,448 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:01:42,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2024-11-13 13:01:42,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2024-11-13 13:01:42,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2024-11-13 13:01:42,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2024-11-13 13:01:42,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2024-11-13 13:01:42,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2024-11-13 13:01:42,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2024-11-13 13:01:42,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2024-11-13 13:01:42,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2024-11-13 13:01:42,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2024-11-13 13:01:42,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2024-11-13 13:01:42,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2024-11-13 13:01:42,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2024-11-13 13:01:42,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:01:42,554 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:01:42,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42 WrapperNode [2024-11-13 13:01:42,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:01:42,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:01:42,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:01:42,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:01:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,598 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 207 [2024-11-13 13:01:42,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:01:42,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:01:42,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:01:42,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:01:42,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,649 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-11-13 13:01:42,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:01:42,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:01:42,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:01:42,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:01:42,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (1/1) ... [2024-11-13 13:01:42,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:01:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:42,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:01:42,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:01:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:01:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:01:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:01:42,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:01:42,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:01:43,251 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-13 13:01:43,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:01:43,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:01:43,269 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-13 13:01:43,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:01:43 BoogieIcfgContainer [2024-11-13 13:01:43,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:01:43,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:01:43,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:01:43,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:01:43,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:01:42" (1/3) ... [2024-11-13 13:01:43,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf2933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:01:43, skipping insertion in model container [2024-11-13 13:01:43,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:01:42" (2/3) ... [2024-11-13 13:01:43,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf2933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:01:43, skipping insertion in model container [2024-11-13 13:01:43,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:01:43" (3/3) ... [2024-11-13 13:01:43,281 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2024-11-13 13:01:43,297 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:01:43,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-01-1.i that has 1 procedures, 83 locations, 1 initial locations, 17 loop locations, and 13 error locations. [2024-11-13 13:01:43,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:01:43,384 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;@757b45af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:01:43,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-13 13:01:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:01:43,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:43,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:01:43,398 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-11-13 13:01:43,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2024-11-13 13:01:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719310830] [2024-11-13 13:01:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:43,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:43,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719310830] [2024-11-13 13:01:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719310830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491674666] [2024-11-13 13:01:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:43,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:43,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:43,652 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:43,739 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2024-11-13 13:01:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-13 13:01:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:43,752 INFO L225 Difference]: With dead ends: 180 [2024-11-13 13:01:43,752 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 13:01:43,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:43,760 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:43,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 13:01:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2024-11-13 13:01:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-11-13 13:01:43,808 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2024-11-13 13:01:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:43,808 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-11-13 13:01:43,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-13 13:01:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:01:43,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:43,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:43,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:01:43,812 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-11-13 13:01:43,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2024-11-13 13:01:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306638178] [2024-11-13 13:01:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306638178] [2024-11-13 13:01:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306638178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:43,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:43,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212772821] [2024-11-13 13:01:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:43,926 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:43,983 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-13 13:01:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:43,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 13:01:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:43,985 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:01:43,987 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:01:43,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:43,988 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:43,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:01:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-13 13:01:44,003 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-11-13 13:01:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-13 13:01:44,006 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2024-11-13 13:01:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:44,006 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-13 13:01:44,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-13 13:01:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:01:44,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:44,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:44,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:01:44,009 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-11-13 13:01:44,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:44,009 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2024-11-13 13:01:44,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:44,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767677443] [2024-11-13 13:01:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:44,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767677443] [2024-11-13 13:01:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767677443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157676154] [2024-11-13 13:01:44,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:44,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:44,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:01:44,258 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:44,348 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-11-13 13:01:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 13:01:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:44,350 INFO L225 Difference]: With dead ends: 79 [2024-11-13 13:01:44,350 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 13:01:44,350 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-11-13 13:01:44,351 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:44,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 13:01:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-13 13:01:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 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-11-13 13:01:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-13 13:01:44,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2024-11-13 13:01:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-13 13:01:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-13 13:01:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 13:01:44,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:44,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:44,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:01:44,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:44,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1712588329, now seen corresponding path program 1 times [2024-11-13 13:01:44,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928063010] [2024-11-13 13:01:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928063010] [2024-11-13 13:01:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928063010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650334453] [2024-11-13 13:01:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:44,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:44,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:44,431 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 5.0) 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-11-13 13:01:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:44,493 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-13 13:01:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:44,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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-11-13 13:01:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:44,495 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:01:44,495 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 13:01:44,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:44,496 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:44,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 13:01:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-13 13:01:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) 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-11-13 13:01:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-11-13 13:01:44,504 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2024-11-13 13:01:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:44,504 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-11-13 13:01:44,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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-11-13 13:01:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-11-13 13:01:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:01:44,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:44,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:44,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:01:44,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1550634846, now seen corresponding path program 1 times [2024-11-13 13:01:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733642522] [2024-11-13 13:01:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733642522] [2024-11-13 13:01:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733642522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196174875] [2024-11-13 13:01:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:01:44,781 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:44,937 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2024-11-13 13:01:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:01:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:44,938 INFO L225 Difference]: With dead ends: 187 [2024-11-13 13:01:44,939 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 13:01:44,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:44,940 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 56 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:44,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 187 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 13:01:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2024-11-13 13:01:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 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-11-13 13:01:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-13 13:01:44,955 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2024-11-13 13:01:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:44,956 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-13 13:01:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-13 13:01:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:01:44,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:44,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:01:44,957 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-11-13 13:01:44,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2064274080, now seen corresponding path program 1 times [2024-11-13 13:01:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137709613] [2024-11-13 13:01:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137709613] [2024-11-13 13:01:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137709613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530135307] [2024-11-13 13:01:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:01:45,068 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:45,197 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-11-13 13:01:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:01:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:45,199 INFO L225 Difference]: With dead ends: 132 [2024-11-13 13:01:45,200 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 13:01:45,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:45,201 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:45,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 13:01:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2024-11-13 13:01:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) 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-11-13 13:01:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-13 13:01:45,216 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2024-11-13 13:01:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:45,216 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-13 13:01:45,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-13 13:01:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:01:45,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:45,217 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-11-13 13:01:45,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:01:45,218 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-11-13 13:01:45,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1793102998, now seen corresponding path program 1 times [2024-11-13 13:01:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471034616] [2024-11-13 13:01:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471034616] [2024-11-13 13:01:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471034616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:45,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:45,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073035924] [2024-11-13 13:01:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:45,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,278 INFO L87 Difference]: Start difference. First operand 72 states and 81 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-11-13 13:01:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:45,302 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2024-11-13 13:01:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:45,302 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-11-13 13:01:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:45,303 INFO L225 Difference]: With dead ends: 118 [2024-11-13 13:01:45,303 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 13:01:45,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,304 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:45,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 13:01:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-13 13:01:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 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-11-13 13:01:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-13 13:01:45,323 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2024-11-13 13:01:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-13 13:01:45,323 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-11-13 13:01:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-13 13:01:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:01:45,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:45,324 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] [2024-11-13 13:01:45,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:01:45,324 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-11-13 13:01:45,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash 248377405, now seen corresponding path program 1 times [2024-11-13 13:01:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278113638] [2024-11-13 13:01:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:45,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:45,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278113638] [2024-11-13 13:01:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278113638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:45,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174899442] [2024-11-13 13:01:45,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,384 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:45,414 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-13 13:01:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 13:01:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:45,416 INFO L225 Difference]: With dead ends: 75 [2024-11-13 13:01:45,416 INFO L226 Difference]: Without dead ends: 73 [2024-11-13 13:01:45,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,417 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:45,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-13 13:01:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-13 13:01:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-13 13:01:45,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2024-11-13 13:01:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-13 13:01:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-13 13:01:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 13:01:45,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:45,442 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-11-13 13:01:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:01:45,442 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-11-13 13:01:45,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1898588149, now seen corresponding path program 1 times [2024-11-13 13:01:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:45,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504883431] [2024-11-13 13:01:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:45,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504883431] [2024-11-13 13:01:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504883431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300700766] [2024-11-13 13:01:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,511 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-11-13 13:01:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:45,535 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-11-13 13:01:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-11-13 13:01:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:45,538 INFO L225 Difference]: With dead ends: 76 [2024-11-13 13:01:45,538 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 13:01:45,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:45,539 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:45,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 13:01:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-13 13:01:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2537313432835822) 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-11-13 13:01:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-13 13:01:45,558 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 23 [2024-11-13 13:01:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:45,558 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-13 13:01:45,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-11-13 13:01:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-13 13:01:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 13:01:45,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:45,559 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-11-13 13:01:45,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:01:45,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1898590071, now seen corresponding path program 1 times [2024-11-13 13:01:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543901826] [2024-11-13 13:01:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:45,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543901826] [2024-11-13 13:01:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543901826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158645992] [2024-11-13 13:01:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:01:45,749 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-11-13 13:01:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:45,859 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-13 13:01:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-11-13 13:01:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:45,860 INFO L225 Difference]: With dead ends: 75 [2024-11-13 13:01:45,860 INFO L226 Difference]: Without dead ends: 73 [2024-11-13 13:01:45,860 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-11-13 13:01:45,861 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:45,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-13 13:01:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-13 13:01:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 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-11-13 13:01:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-13 13:01:45,876 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2024-11-13 13:01:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:45,876 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-13 13:01:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-11-13 13:01:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-13 13:01:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:01:45,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:45,877 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] [2024-11-13 13:01:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:01:45,877 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-11-13 13:01:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -813287265, now seen corresponding path program 1 times [2024-11-13 13:01:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572693095] [2024-11-13 13:01:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572693095] [2024-11-13 13:01:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572693095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:01:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691286042] [2024-11-13 13:01:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:46,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:01:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:01:46,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:01:46,127 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:46,366 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2024-11-13 13:01:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:01:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 13:01:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:46,368 INFO L225 Difference]: With dead ends: 175 [2024-11-13 13:01:46,368 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 13:01:46,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-13 13:01:46,369 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:46,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 251 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 13:01:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2024-11-13 13:01:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2024-11-13 13:01:46,382 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2024-11-13 13:01:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:46,383 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2024-11-13 13:01:46,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2024-11-13 13:01:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:01:46,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:46,383 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] [2024-11-13 13:01:46,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:01:46,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:46,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash -913883105, now seen corresponding path program 1 times [2024-11-13 13:01:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716167407] [2024-11-13 13:01:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716167407] [2024-11-13 13:01:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716167407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:01:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325860397] [2024-11-13 13:01:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:01:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:01:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:01:47,463 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:48,172 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2024-11-13 13:01:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:01:48,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 13:01:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:48,174 INFO L225 Difference]: With dead ends: 171 [2024-11-13 13:01:48,174 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 13:01:48,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:01:48,175 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 249 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:48,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 305 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:01:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 13:01:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2024-11-13 13:01:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2024-11-13 13:01:48,212 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 24 [2024-11-13 13:01:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:48,213 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2024-11-13 13:01:48,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2024-11-13 13:01:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 13:01:48,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:48,214 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-11-13 13:01:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:01:48,214 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-11-13 13:01:48,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash -523416042, now seen corresponding path program 1 times [2024-11-13 13:01:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830936665] [2024-11-13 13:01:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830936665] [2024-11-13 13:01:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830936665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:01:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974009227] [2024-11-13 13:01:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:48,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:01:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:01:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:48,348 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-13 13:01:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:48,510 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2024-11-13 13:01:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:01:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-13 13:01:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:48,511 INFO L225 Difference]: With dead ends: 145 [2024-11-13 13:01:48,511 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 13:01:48,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:01:48,512 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:48,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 13:01:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2024-11-13 13:01:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 119 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2024-11-13 13:01:48,555 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 26 [2024-11-13 13:01:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2024-11-13 13:01:48,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-13 13:01:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2024-11-13 13:01:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 13:01:48,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:48,558 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-11-13 13:01:48,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:01:48,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:48,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1588229526, now seen corresponding path program 1 times [2024-11-13 13:01:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51533527] [2024-11-13 13:01:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51533527] [2024-11-13 13:01:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51533527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55337368] [2024-11-13 13:01:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:48,628 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-13 13:01:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:48,704 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2024-11-13 13:01:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-13 13:01:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:48,705 INFO L225 Difference]: With dead ends: 120 [2024-11-13 13:01:48,705 INFO L226 Difference]: Without dead ends: 118 [2024-11-13 13:01:48,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:48,707 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:48,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 77 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-13 13:01:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-13 13:01:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.247787610619469) internal successors, (141), 117 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-13 13:01:48,738 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 26 [2024-11-13 13:01:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-13 13:01:48,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-13 13:01:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2024-11-13 13:01:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:01:48,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:48,742 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] [2024-11-13 13:01:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:01:48,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 310217551, now seen corresponding path program 1 times [2024-11-13 13:01:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387457] [2024-11-13 13:01:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845387457] [2024-11-13 13:01:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845387457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:01:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018454749] [2024-11-13 13:01:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:49,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:01:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:01:49,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:01:49,342 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:49,899 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2024-11-13 13:01:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:01:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:49,901 INFO L225 Difference]: With dead ends: 227 [2024-11-13 13:01:49,902 INFO L226 Difference]: Without dead ends: 225 [2024-11-13 13:01:49,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-11-13 13:01:49,902 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 189 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 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.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:49,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 339 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:01:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-13 13:01:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 125. [2024-11-13 13:01:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.2333333333333334) internal successors, (148), 124 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2024-11-13 13:01:49,939 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 27 [2024-11-13 13:01:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:49,939 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2024-11-13 13:01:49,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2024-11-13 13:01:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:01:49,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:49,941 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] [2024-11-13 13:01:49,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:01:49,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:49,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -714864540, now seen corresponding path program 1 times [2024-11-13 13:01:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551262056] [2024-11-13 13:01:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551262056] [2024-11-13 13:01:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551262056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443784703] [2024-11-13 13:01:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:50,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:50,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:50,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:01:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:50,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:01:50,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:50,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:50,424 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-11-13 13:01:50,436 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-11-13 13:01:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:50,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443784703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:01:50,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:01:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-13 13:01:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498065068] [2024-11-13 13:01:50,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:01:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:01:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:01:50,832 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:51,236 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2024-11-13 13:01:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:01:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 13:01:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:51,239 INFO L225 Difference]: With dead ends: 213 [2024-11-13 13:01:51,239 INFO L226 Difference]: Without dead ends: 153 [2024-11-13 13:01:51,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:01:51,240 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 103 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:51,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 288 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:01:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-13 13:01:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2024-11-13 13:01:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 115 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2024-11-13 13:01:51,272 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 29 [2024-11-13 13:01:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:51,273 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2024-11-13 13:01:51,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2024-11-13 13:01:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:01:51,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:51,273 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] [2024-11-13 13:01:51,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:01:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:01:51,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1590256095, now seen corresponding path program 1 times [2024-11-13 13:01:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760128011] [2024-11-13 13:01:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760128011] [2024-11-13 13:01:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760128011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:51,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:01:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125994152] [2024-11-13 13:01:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:51,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:01:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:01:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:01:51,942 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:52,355 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2024-11-13 13:01:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:01:52,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-13 13:01:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:52,356 INFO L225 Difference]: With dead ends: 197 [2024-11-13 13:01:52,357 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 13:01:52,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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-11-13 13:01:52,358 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 272 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 340 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.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:52,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 340 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:01:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 13:01:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2024-11-13 13:01:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.182608695652174) internal successors, (136), 119 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2024-11-13 13:01:52,383 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 29 [2024-11-13 13:01:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-13 13:01:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2024-11-13 13:01:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:01:52,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:52,384 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, 1] [2024-11-13 13:01:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:01:52,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1052222229, now seen corresponding path program 1 times [2024-11-13 13:01:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046640351] [2024-11-13 13:01:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:52,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:52,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046640351] [2024-11-13 13:01:52,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046640351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:52,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:01:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950230233] [2024-11-13 13:01:52,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:01:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:01:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:52,429 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:52,475 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2024-11-13 13:01:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:01:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-11-13 13:01:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:52,477 INFO L225 Difference]: With dead ends: 207 [2024-11-13 13:01:52,477 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 13:01:52,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:01:52,478 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 142 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-11-13 13:01:52,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:01:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 13:01:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2024-11-13 13:01:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.1884057971014492) internal successors, (164), 142 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2024-11-13 13:01:52,512 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 31 [2024-11-13 13:01:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:52,512 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2024-11-13 13:01:52,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2024-11-13 13:01:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 13:01:52,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:52,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, 1] [2024-11-13 13:01:52,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:01:52,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-13 13:01:52,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1078157634, now seen corresponding path program 1 times [2024-11-13 13:01:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581555026] [2024-11-13 13:01:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581555026] [2024-11-13 13:01:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581555026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365355095] [2024-11-13 13:01:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:52,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:52,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:01:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:52,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 13:01:52,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:52,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:52,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:52,864 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 27 treesize of output 11 [2024-11-13 13:01:52,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 13:01:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:53,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365355095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:01:53,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:01:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 7 [2024-11-13 13:01:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753994813] [2024-11-13 13:01:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:01:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:01:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:01:53,164 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:53,498 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2024-11-13 13:01:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:01:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 32 [2024-11-13 13:01:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:53,500 INFO L225 Difference]: With dead ends: 250 [2024-11-13 13:01:53,500 INFO L226 Difference]: Without dead ends: 218 [2024-11-13 13:01:53,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:01:53,501 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 91 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:53,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 323 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-13 13:01:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 165. [2024-11-13 13:01:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.225) internal successors, (196), 164 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 196 transitions. [2024-11-13 13:01:53,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 196 transitions. Word has length 32 [2024-11-13 13:01:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 196 transitions. [2024-11-13 13:01:53,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 196 transitions. [2024-11-13 13:01:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:01:53,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:53,560 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, 1] [2024-11-13 13:01:53,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:01:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:53,761 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-11-13 13:01:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -851138616, now seen corresponding path program 1 times [2024-11-13 13:01:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53535745] [2024-11-13 13:01:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:53,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53535745] [2024-11-13 13:01:53,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53535745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:53,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:53,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637088776] [2024-11-13 13:01:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:53,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:01:53,937 INFO L87 Difference]: Start difference. First operand 165 states and 196 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:54,076 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2024-11-13 13:01:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:54,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:01:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:54,077 INFO L225 Difference]: With dead ends: 277 [2024-11-13 13:01:54,077 INFO L226 Difference]: Without dead ends: 172 [2024-11-13 13:01:54,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:54,078 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:54,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-13 13:01:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-11-13 13:01:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2024-11-13 13:01:54,112 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 36 [2024-11-13 13:01:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:54,112 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2024-11-13 13:01:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2024-11-13 13:01:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:01:54,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:54,113 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, 1] [2024-11-13 13:01:54,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:01:54,113 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-11-13 13:01:54,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1872206970, now seen corresponding path program 1 times [2024-11-13 13:01:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918921440] [2024-11-13 13:01:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918921440] [2024-11-13 13:01:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918921440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090561905] [2024-11-13 13:01:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:54,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:54,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:01:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:54,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:01:54,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:54,866 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-11-13 13:01:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:55,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:01:55,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:01:55,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:55,082 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-11-13 13:01:55,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:55,090 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-11-13 13:01:55,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:55,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:55,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:55,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:55,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:55,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)))) is different from false [2024-11-13 13:01:58,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:58,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:58,184 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 25 treesize of output 31 [2024-11-13 13:01:58,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 13:01:58,197 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 7 treesize of output 3 [2024-11-13 13:01:58,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:58,207 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 13:01:58,207 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 25 treesize of output 1 [2024-11-13 13:02:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:02:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090561905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:02:00,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:02:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-11-13 13:02:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174735622] [2024-11-13 13:02:00,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:02:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:02:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:02:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:02:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=262, Unknown=2, NotChecked=34, Total=380 [2024-11-13 13:02:00,532 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:02:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:02:01,506 INFO L93 Difference]: Finished difference Result 403 states and 475 transitions. [2024-11-13 13:02:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:02:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:02:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:02:01,508 INFO L225 Difference]: With dead ends: 403 [2024-11-13 13:02:01,508 INFO L226 Difference]: Without dead ends: 315 [2024-11-13 13:02:01,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=174, Invalid=428, Unknown=2, NotChecked=46, Total=650 [2024-11-13 13:02:01,510 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 282 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:02:01,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 677 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 372 Invalid, 0 Unknown, 182 Unchecked, 0.6s Time] [2024-11-13 13:02:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-13 13:02:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 191. [2024-11-13 13:02:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2096774193548387) internal successors, (225), 190 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:02:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2024-11-13 13:02:01,563 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 36 [2024-11-13 13:02:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:02:01,564 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2024-11-13 13:02:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:02:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2024-11-13 13:02:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:02:01,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:02:01,565 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, 1] [2024-11-13 13:02:01,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:02:01,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:02:01,769 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-11-13 13:02:01,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:02:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1738156806, now seen corresponding path program 1 times [2024-11-13 13:02:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:02:01,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235296196] [2024-11-13 13:02:01,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:02:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:02:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:02:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:02:02,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:02:02,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235296196] [2024-11-13 13:02:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235296196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:02:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652692037] [2024-11-13 13:02:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:02:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:02:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:02:02,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:02:02,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0d8fe7-6363-4bae-bf5d-2943db46a1fa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:02:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:02:03,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 13:02:03,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:02:03,068 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-11-13 13:02:03,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:02:03,115 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 13:02:03,143 INFO L349 Elim1Store]: treesize reduction 105, result has 6.3 percent of original size [2024-11-13 13:02:03,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 281 [2024-11-13 13:02:03,156 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-13 13:02:03,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 38 [2024-11-13 13:02:03,189 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-13 13:02:03,189 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 25 treesize of output 29 [2024-11-13 13:02:03,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:02:03,482 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-11-13 13:02:03,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:02:03,509 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-13 13:02:03,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 69 [2024-11-13 13:02:03,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:02:03,531 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-13 13:02:03,531 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 70 treesize of output 57 [2024-11-13 13:02:03,561 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-13 13:02:03,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2024-11-13 13:02:03,605 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-13 13:02:03,606 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-11-13 13:02:03,819 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-13 13:02:03,820 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 69 treesize of output 56 [2024-11-13 13:02:03,826 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 38 treesize of output 30 [2024-11-13 13:02:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:02:04,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:02:04,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_652 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_652))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)) (forall ((v_ArrVal_652 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_653))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)))) is different from false [2024-11-13 13:02:18,819 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 360 DAG size of output: 212 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:02:18,819 INFO L349 Elim1Store]: treesize reduction 23294, result has 25.9 percent of original size [2024-11-13 13:02:18,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 31 case distinctions, treesize of input 43824 treesize of output 31139 [2024-11-13 13:02:54,053 WARN L286 SmtUtils]: Spent 33.63s on a formula simplification. DAG size of input: 734 DAG size of output: 446 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:02:54,053 INFO L349 Elim1Store]: treesize reduction 5651, result has 35.5 percent of original size [2024-11-13 13:02:54,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 16 new quantified variables, introduced 89 case distinctions, treesize of input 420946 treesize of output 156415 [2024-11-13 13:03:01,171 INFO L224 Elim1Store]: Index analysis took 631 ms [2024-11-13 13:04:42,257 WARN L286 SmtUtils]: Spent 1.68m on a formula simplification. DAG size of input: 887 DAG size of output: 163 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:04:42,257 INFO L349 Elim1Store]: treesize reduction 8793, result has 4.8 percent of original size [2024-11-13 13:04:42,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 13 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 154 case distinctions, treesize of input 76331 treesize of output 73777 [2024-11-13 13:04:48,194 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 3482 DAG size of output: 2562 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:04:54,935 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 2556 DAG size of output: 2623 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:05:09,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:05:09,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:05:09,910 INFO L224 Elim1Store]: Index analysis took 1170 ms [2024-11-13 13:05:41,537 WARN L286 SmtUtils]: Spent 31.62s on a formula simplification. DAG size of input: 118 DAG size of output: 114 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:05:41,537 INFO L349 Elim1Store]: treesize reduction 19, result has 94.6 percent of original size [2024-11-13 13:05:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 34 case distinctions, treesize of input 13990 treesize of output 13655 [2024-11-13 13:05:53,079 INFO L224 Elim1Store]: Index analysis took 789 ms [2024-11-13 13:07:52,860 WARN L286 SmtUtils]: Spent 1.99m on a formula simplification. DAG size of input: 824 DAG size of output: 175 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:07:52,860 INFO L349 Elim1Store]: treesize reduction 6424, result has 7.1 percent of original size [2024-11-13 13:07:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 17 new quantified variables, introduced 123 case distinctions, treesize of input 60190 treesize of output 59614 [2024-11-13 13:08:02,061 WARN L286 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 4404 DAG size of output: 3767 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:08:11,600 WARN L286 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 3753 DAG size of output: 3799 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:08:13,036 INFO L224 Elim1Store]: Index analysis took 500 ms [2024-11-13 13:08:15,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:08:15,418 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 20682 treesize of output 20066 [2024-11-13 13:09:02,160 WARN L286 SmtUtils]: Spent 37.55s on a formula simplification. DAG size of input: 4395 DAG size of output: 5229 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:10:02,711 WARN L286 SmtUtils]: Spent 56.51s on a formula simplification. DAG size of input: 4302 DAG size of output: 5737 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:10:20,959 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 2146 DAG size of output: 2759 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:10:31,286 INFO L224 Elim1Store]: Index analysis took 106 ms [2024-11-13 13:10:31,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:10:31,786 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 13358 treesize of output 12848 [2024-11-13 13:10:35,969 INFO L224 Elim1Store]: Index analysis took 1660 ms [2024-11-13 13:10:39,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:10:39,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 9809 treesize of output 8526