./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB --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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:07:55,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:07:55,576 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:07:55,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:07:55,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:07:55,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:07:55,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:07:55,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:07:55,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:07:55,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:07:55,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:07:55,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:07:55,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:07:55,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:07:55,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:07:55,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:07:55,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:55,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:55,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:55,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:07:55,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:07:55,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:07:55,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:07:55,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:07:55,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:07:55,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:07:55,640 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_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2024-11-28 02:07:55,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:07:55,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:07:55,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:07:55,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:07:55,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:07:55,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-28 02:07:58,888 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/99bcf02ee/0ceec2b0322644969eab64f0b819bb28/FLAG7ac2f7bf9 [2024-11-28 02:07:59,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:07:59,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-28 02:07:59,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/99bcf02ee/0ceec2b0322644969eab64f0b819bb28/FLAG7ac2f7bf9 [2024-11-28 02:07:59,340 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/99bcf02ee/0ceec2b0322644969eab64f0b819bb28 [2024-11-28 02:07:59,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:07:59,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:07:59,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:59,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:07:59,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:07:59,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:07:59,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea61e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59, skipping insertion in model container [2024-11-28 02:07:59,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:07:59,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:07:59,827 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2024-11-28 02:07:59,832 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2024-11-28 02:07:59,835 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2024-11-28 02:07:59,836 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2024-11-28 02:07:59,838 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2024-11-28 02:07:59,840 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2024-11-28 02:07:59,841 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2024-11-28 02:07:59,843 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2024-11-28 02:07:59,843 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2024-11-28 02:07:59,845 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2024-11-28 02:07:59,846 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2024-11-28 02:07:59,849 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2024-11-28 02:07:59,850 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2024-11-28 02:07:59,851 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2024-11-28 02:07:59,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:59,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:07:59,932 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2024-11-28 02:07:59,935 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2024-11-28 02:07:59,936 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2024-11-28 02:07:59,937 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2024-11-28 02:07:59,938 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2024-11-28 02:07:59,938 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2024-11-28 02:07:59,939 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2024-11-28 02:07:59,940 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2024-11-28 02:07:59,943 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2024-11-28 02:07:59,944 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2024-11-28 02:07:59,945 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2024-11-28 02:07:59,946 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2024-11-28 02:07:59,949 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2024-11-28 02:07:59,950 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2024-11-28 02:07:59,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:59,993 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:07:59,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59 WrapperNode [2024-11-28 02:07:59,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:59,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:59,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:07:59,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:08:00,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,043 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 207 [2024-11-28 02:08:00,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:08:00,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:08:00,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:08:00,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:08:00,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,080 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 9 writes are split as follows [0, 9]. [2024-11-28 02:08:00,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:08:00,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:08:00,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:08:00,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:08:00,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (1/1) ... [2024-11-28 02:08:00,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:08:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:00,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:08:00,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:08:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:08:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:08:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:08:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:08:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:08:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:08:00,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:08:00,332 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:08:00,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:08:00,704 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-28 02:08:00,704 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:08:00,724 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:08:00,724 INFO L312 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-28 02:08:00,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:08:00 BoogieIcfgContainer [2024-11-28 02:08:00,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:08:00,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:08:00,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:08:00,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:08:00,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:07:59" (1/3) ... [2024-11-28 02:08:00,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78203476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:08:00, skipping insertion in model container [2024-11-28 02:08:00,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:59" (2/3) ... [2024-11-28 02:08:00,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78203476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:08:00, skipping insertion in model container [2024-11-28 02:08:00,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:08:00" (3/3) ... [2024-11-28 02:08:00,737 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2024-11-28 02:08:00,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:08:00,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-queue-1.i that has 1 procedures, 87 locations, 1 initial locations, 17 loop locations, and 14 error locations. [2024-11-28 02:08:00,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:08:00,823 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;@1b8269cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:08:00,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-28 02:08:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 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-28 02:08:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 02:08:00,832 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:00,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 02:08:00,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 28757443, now seen corresponding path program 1 times [2024-11-28 02:08:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147889286] [2024-11-28 02:08:00,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:01,088 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-28 02:08:01,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:01,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147889286] [2024-11-28 02:08:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147889286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:01,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785515016] [2024-11-28 02:08:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:01,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:08:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:01,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:08:01,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:08:01,122 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 02:08:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:01,155 INFO L93 Difference]: Finished difference Result 172 states and 282 transitions. [2024-11-28 02:08:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:08:01,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-28 02:08:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:01,166 INFO L225 Difference]: With dead ends: 172 [2024-11-28 02:08:01,167 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 02:08:01,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:08:01,176 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:01,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 02:08:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-28 02:08:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 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-28 02:08:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-28 02:08:01,226 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 5 [2024-11-28 02:08:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-28 02:08:01,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 02:08:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-28 02:08:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:08:01,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:01,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:08:01,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:08:01,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:01,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 889542441, now seen corresponding path program 1 times [2024-11-28 02:08:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22960723] [2024-11-28 02:08:01,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:01,376 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-28 02:08:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22960723] [2024-11-28 02:08:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22960723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175717546] [2024-11-28 02:08:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:01,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:01,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:01,379 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-28 02:08:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:01,431 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-11-28 02:08:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:01,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-28 02:08:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:01,432 INFO L225 Difference]: With dead ends: 81 [2024-11-28 02:08:01,432 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 02:08:01,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:01,434 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 76 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:01,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 02:08:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 02:08:01,441 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-28 02:08:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-11-28 02:08:01,442 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 6 [2024-11-28 02:08:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-11-28 02:08:01,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-28 02:08:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-11-28 02:08:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 02:08:01,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:01,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:01,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:08:01,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:01,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 535764304, now seen corresponding path program 1 times [2024-11-28 02:08:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157013994] [2024-11-28 02:08:01,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:01,948 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-28 02:08:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157013994] [2024-11-28 02:08:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157013994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:01,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:01,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:08:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641503310] [2024-11-28 02:08:01,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:01,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:08:01,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:01,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:08:01,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:08:01,951 INFO L87 Difference]: Start difference. First operand 71 states and 80 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-28 02:08:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:02,118 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2024-11-28 02:08:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:08:02,119 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-28 02:08:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:02,122 INFO L225 Difference]: With dead ends: 121 [2024-11-28 02:08:02,122 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 02:08:02,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:08:02,123 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 161 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:02,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 126 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:08:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 02:08:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 69. [2024-11-28 02:08:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 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-28 02:08:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-28 02:08:02,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 10 [2024-11-28 02:08:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:02,147 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-28 02:08:02,147 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-28 02:08:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-28 02:08:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:08:02,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:02,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:02,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:08:02,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:02,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1924295232, now seen corresponding path program 1 times [2024-11-28 02:08:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883376593] [2024-11-28 02:08:02,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:02,326 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-28 02:08:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883376593] [2024-11-28 02:08:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883376593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285333322] [2024-11-28 02:08:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:02,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:02,329 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-28 02:08:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:02,401 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2024-11-28 02:08:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-28 02:08:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:02,406 INFO L225 Difference]: With dead ends: 156 [2024-11-28 02:08:02,407 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 02:08:02,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:02,408 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:02,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:08:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 02:08:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2024-11-28 02:08:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-28 02:08:02,435 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 12 [2024-11-28 02:08:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:02,435 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-28 02:08:02,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-28 02:08:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-28 02:08:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 02:08:02,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:02,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:02,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:08:02,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:02,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 570240528, now seen corresponding path program 1 times [2024-11-28 02:08:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282505585] [2024-11-28 02:08:02,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:02,765 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-28 02:08:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282505585] [2024-11-28 02:08:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282505585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:08:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714821970] [2024-11-28 02:08:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:08:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:02,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:08:02,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:08:02,767 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:02,937 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-28 02:08:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:08:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 02:08:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:02,941 INFO L225 Difference]: With dead ends: 93 [2024-11-28 02:08:02,942 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 02:08:02,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:08:02,943 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:02,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 269 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:08:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 02:08:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 02:08:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 72 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-28 02:08:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-28 02:08:02,961 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2024-11-28 02:08:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-28 02:08:02,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-28 02:08:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 02:08:02,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:02,965 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:02,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:08:02,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:02,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1713214930, now seen corresponding path program 1 times [2024-11-28 02:08:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265293954] [2024-11-28 02:08:02,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:03,306 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-28 02:08:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265293954] [2024-11-28 02:08:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265293954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101361496] [2024-11-28 02:08:03,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:03,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:03,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:08:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:03,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 02:08:03,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:03,520 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-28 02:08:03,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-28 02:08:03,651 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-28 02:08:03,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 53 [2024-11-28 02:08:03,662 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 34 treesize of output 24 [2024-11-28 02:08:03,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:03,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:08:03,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 02:08:03,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:03,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:08:03,740 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:08:03,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 02:08:03,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 02:08:03,846 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-28 02:08:03,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:03,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:03,928 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 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-28 02:08:03,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:03,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 133 [2024-11-28 02:08:03,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:03,965 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 76 treesize of output 75 [2024-11-28 02:08:03,975 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 66 treesize of output 62 [2024-11-28 02:08:04,323 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-28 02:08:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101361496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:08:04,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:08:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-28 02:08:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929870960] [2024-11-28 02:08:04,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:08:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:04,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:08:04,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=63, Unknown=2, NotChecked=0, Total=90 [2024-11-28 02:08:04,325 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-28 02:08:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:04,561 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2024-11-28 02:08:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:08:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-28 02:08:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:04,563 INFO L225 Difference]: With dead ends: 147 [2024-11-28 02:08:04,563 INFO L226 Difference]: Without dead ends: 145 [2024-11-28 02:08:04,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=75, Unknown=2, NotChecked=0, Total=110 [2024-11-28 02:08:04,564 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 142 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 359 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:08:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-28 02:08:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 86. [2024-11-28 02:08:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 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-28 02:08:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-28 02:08:04,589 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 20 [2024-11-28 02:08:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:04,591 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-28 02:08:04,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-28 02:08:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-28 02:08:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:08:04,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:04,592 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:04,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:08:04,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 02:08:04,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:04,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1259299224, now seen corresponding path program 1 times [2024-11-28 02:08:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:04,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57004189] [2024-11-28 02:08:04,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:04,847 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-28 02:08:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57004189] [2024-11-28 02:08:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57004189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767367909] [2024-11-28 02:08:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:04,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:04,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:04,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:04,849 INFO L87 Difference]: Start difference. First operand 86 states and 96 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-28 02:08:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:04,910 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2024-11-28 02:08:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:04,910 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-28 02:08:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:04,912 INFO L225 Difference]: With dead ends: 178 [2024-11-28 02:08:04,912 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 02:08:04,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:04,913 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:04,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 02:08:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2024-11-28 02:08:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 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-28 02:08:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-28 02:08:04,935 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 21 [2024-11-28 02:08:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:04,935 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-28 02:08:04,935 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-28 02:08:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-28 02:08:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:08:04,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:04,940 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:04,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:08:04,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -61944223, now seen corresponding path program 1 times [2024-11-28 02:08:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:04,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524020921] [2024-11-28 02:08:04,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:08:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524020921] [2024-11-28 02:08:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524020921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:05,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:05,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972972216] [2024-11-28 02:08:05,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:05,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:05,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:05,063 INFO L87 Difference]: Start difference. First operand 100 states and 110 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-28 02:08:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:05,117 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2024-11-28 02:08:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:05,120 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 29 [2024-11-28 02:08:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:05,121 INFO L225 Difference]: With dead ends: 207 [2024-11-28 02:08:05,121 INFO L226 Difference]: Without dead ends: 126 [2024-11-28 02:08:05,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:05,122 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:05,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 145 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-28 02:08:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2024-11-28 02:08:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 106 states have (on average 1.179245283018868) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 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-28 02:08:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-28 02:08:05,144 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 29 [2024-11-28 02:08:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:05,144 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-28 02:08:05,145 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-28 02:08:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-28 02:08:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:08:05,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:05,147 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:05,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:08:05,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2063940329, now seen corresponding path program 1 times [2024-11-28 02:08:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:05,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236654534] [2024-11-28 02:08:05,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236654534] [2024-11-28 02:08:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236654534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031012770] [2024-11-28 02:08:06,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:06,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:06,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:08:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:06,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 02:08:06,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:06,299 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-28 02:08:06,352 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 02:08:06,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-28 02:08:06,359 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 30 treesize of output 22 [2024-11-28 02:08:06,367 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 5 treesize of output 3 [2024-11-28 02:08:06,388 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:08:06,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:08:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 02:08:06,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:06,406 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-28 02:08:06,428 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-28 02:08:06,612 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 02:08:06,613 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 49 [2024-11-28 02:08:06,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:06,634 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 02:08:06,635 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 79 treesize of output 64 [2024-11-28 02:08:06,647 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 5 treesize of output 3 [2024-11-28 02:08:06,666 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 02:08:06,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 02:08:06,685 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-28 02:08:06,685 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 49 [2024-11-28 02:08:06,701 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-28 02:08:06,701 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 2 case distinctions, treesize of input 75 treesize of output 47 [2024-11-28 02:08:06,773 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 02:08:06,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2024-11-28 02:08:06,944 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 02:08:06,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-28 02:08:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:06,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:06,990 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-11-28 02:08:07,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:07,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-28 02:08:07,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:07,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 141 [2024-11-28 02:08:07,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:07,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 175 [2024-11-28 02:08:07,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:07,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140624 treesize of output 99423 [2024-11-28 02:08:08,395 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 11866 treesize of output 10542 [2024-11-28 02:08:09,149 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 5174 treesize of output 4850 [2024-11-28 02:08:09,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:09,240 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 4818 treesize of output 4474 [2024-11-28 02:08:09,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:09,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4473 treesize of output 4085 [2024-11-28 02:08:09,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:09,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4032 treesize of output 3699 [2024-11-28 02:08:09,593 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 3674 treesize of output 3582 [2024-11-28 02:08:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 02:08:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031012770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:08:12,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:08:12,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 18 [2024-11-28 02:08:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279358146] [2024-11-28 02:08:12,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:08:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:08:12,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=4, NotChecked=30, Total=306 [2024-11-28 02:08:12,443 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:13,655 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2024-11-28 02:08:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:08:13,658 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 02:08:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:13,659 INFO L225 Difference]: With dead ends: 188 [2024-11-28 02:08:13,659 INFO L226 Difference]: Without dead ends: 186 [2024-11-28 02:08:13,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=421, Unknown=7, NotChecked=44, Total=600 [2024-11-28 02:08:13,660 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 338 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 29 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 705 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 333 Invalid, 42 Unknown, 145 Unchecked, 0.9s Time] [2024-11-28 02:08:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-28 02:08:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 131. [2024-11-28 02:08:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 123 states have (on average 1.1626016260162602) internal successors, (143), 130 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-28 02:08:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2024-11-28 02:08:13,687 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 30 [2024-11-28 02:08:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:13,688 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2024-11-28 02:08:13,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2024-11-28 02:08:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:08:13,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:13,692 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:13,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:08:13,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 02:08:13,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1926087439, now seen corresponding path program 1 times [2024-11-28 02:08:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560888036] [2024-11-28 02:08:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:08:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560888036] [2024-11-28 02:08:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560888036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:13,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116484548] [2024-11-28 02:08:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:13,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:13,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:13,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:13,947 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-28 02:08:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:13,972 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-28 02:08:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 30 [2024-11-28 02:08:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:13,975 INFO L225 Difference]: With dead ends: 134 [2024-11-28 02:08:13,975 INFO L226 Difference]: Without dead ends: 132 [2024-11-28 02:08:13,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:13,976 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 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-28 02:08:13,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-28 02:08:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-28 02:08:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 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-28 02:08:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2024-11-28 02:08:13,995 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 30 [2024-11-28 02:08:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:13,995 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2024-11-28 02:08:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-28 02:08:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2024-11-28 02:08:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:08:13,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:13,997 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:08:13,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:13,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1926089361, now seen corresponding path program 1 times [2024-11-28 02:08:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495756068] [2024-11-28 02:08:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:14,712 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-28 02:08:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495756068] [2024-11-28 02:08:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495756068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787789203] [2024-11-28 02:08:14,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:14,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:14,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:08:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:14,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:08:14,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:14,842 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-28 02:08:14,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:08:14,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:08:14,890 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 02:08:14,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:14,898 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-28 02:08:14,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 02:08:14,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:14,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:08:14,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:14,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-28 02:08:14,919 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-28 02:08:14,964 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:08:14,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-11-28 02:08:14,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-28 02:08:14,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 02:08:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 02:08:15,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 02:08:15,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:08:15,176 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-28 02:08:15,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:15,268 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 72 treesize of output 52 [2024-11-28 02:08:15,362 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 02:08:15,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 147 [2024-11-28 02:08:15,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:15,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 110 [2024-11-28 02:08:15,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:15,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 590 treesize of output 577 [2024-11-28 02:08:15,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:15,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 282 [2024-11-28 02:08:15,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:15,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 331 [2024-11-28 02:08:15,525 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 277 treesize of output 271 [2024-11-28 02:08:15,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:15,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 313 [2024-11-28 02:08:15,581 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 235 treesize of output 223 [2024-11-28 02:08:17,494 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-28 02:08:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787789203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:08:17,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:08:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-28 02:08:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809261059] [2024-11-28 02:08:17,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:08:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:17,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:08:17,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=224, Unknown=6, NotChecked=0, Total=272 [2024-11-28 02:08:17,497 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 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-28 02:08:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:18,167 INFO L93 Difference]: Finished difference Result 224 states and 242 transitions. [2024-11-28 02:08:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:08:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 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) Word has length 30 [2024-11-28 02:08:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:18,169 INFO L225 Difference]: With dead ends: 224 [2024-11-28 02:08:18,169 INFO L226 Difference]: Without dead ends: 222 [2024-11-28 02:08:18,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=430, Unknown=6, NotChecked=0, Total=552 [2024-11-28 02:08:18,170 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 280 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:18,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 714 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:08:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-28 02:08:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 141. [2024-11-28 02:08:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 140 states have internal predecessors, (154), 0 states have call successors, (0), 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-28 02:08:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2024-11-28 02:08:18,191 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 30 [2024-11-28 02:08:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:18,191 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2024-11-28 02:08:18,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 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-28 02:08:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2024-11-28 02:08:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 02:08:18,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:18,193 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:18,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:08:18,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 02:08:18,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2024-11-28 02:08:18,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 98673736, now seen corresponding path program 1 times [2024-11-28 02:08:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941205866] [2024-11-28 02:08:18,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:19,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941205866] [2024-11-28 02:08:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941205866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962602846] [2024-11-28 02:08:19,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:19,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:19,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:08:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:19,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 02:08:19,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:19,445 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-28 02:08:19,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 02:08:19,505 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:08:19,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2024-11-28 02:08:19,509 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 5 treesize of output 3 [2024-11-28 02:08:19,513 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 5 treesize of output 3 [2024-11-28 02:08:19,544 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:08:19,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:08:19,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:19,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-28 02:08:19,564 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-28 02:08:19,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:08:19,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:08:19,578 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 02:08:19,615 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-28 02:08:19,628 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-28 02:08:19,770 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-28 02:08:19,770 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 71 [2024-11-28 02:08:19,779 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 02:08:19,804 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 02:08:19,804 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 62 [2024-11-28 02:08:19,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:08:19,823 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 02:08:19,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 81 [2024-11-28 02:08:19,843 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:08:19,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2024-11-28 02:08:19,850 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 5 treesize of output 3 [2024-11-28 02:08:19,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:19,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-11-28 02:08:19,886 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-28 02:08:19,886 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 48 [2024-11-28 02:08:19,911 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:08:19,911 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:08:19,920 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 5 treesize of output 3 [2024-11-28 02:08:19,939 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-28 02:08:19,940 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 41 [2024-11-28 02:08:20,021 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 02:08:20,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 68 [2024-11-28 02:08:20,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-28 02:08:20,293 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 02:08:20,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2024-11-28 02:08:20,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 02:08:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:20,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:20,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_750))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2024-11-28 02:08:20,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_35| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_35| 0) (not (= 0 (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_743))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_750))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_744) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_746) .cse2 v_ArrVal_749) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|) 0)))) is different from false [2024-11-28 02:08:20,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:20,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2024-11-28 02:08:20,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_22 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_22) .cse3 v_ArrVal_743))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_750))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_744) .cse3 v_ArrVal_746) .cse2 v_ArrVal_749) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) 0)) (= .cse3 0) (not (= (select |c_#valid| .cse3) 0))))) is different from false [2024-11-28 02:08:20,617 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 02:08:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 684 treesize of output 662 [2024-11-28 02:08:20,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:08:20,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 604 treesize of output 406 [2024-11-28 02:09:08,671 WARN L286 SmtUtils]: Spent 47.59s on a formula simplification. DAG size of input: 2510 DAG size of output: 751 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 02:09:08,672 INFO L349 Elim1Store]: treesize reduction 27038, result has 19.3 percent of original size [2024-11-28 02:09:08,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 40 select indices, 40 select index equivalence classes, 0 disjoint index pairs (out of 780 index pairs), introduced 43 new quantified variables, introduced 780 case distinctions, treesize of input 12359325 treesize of output 11755214 [2024-11-28 02:13:26,346 WARN L286 SmtUtils]: Spent 4.29m on a formula simplification. DAG size of input: 6736 DAG size of output: 2999 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:14:05,224 WARN L286 SmtUtils]: Spent 38.84s on a formula simplification. DAG size of input: 2867 DAG size of output: 2755 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:14:05,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:14:05,787 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 9 new quantified variables, introduced 15 case distinctions, treesize of input 366869 treesize of output 324919 [2024-11-28 02:14:18,551 WARN L286 SmtUtils]: Spent 12.76s on a formula simplification that was a NOOP. DAG size: 2819 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:14:30,745 WARN L286 SmtUtils]: Spent 12.15s on a formula simplification that was a NOOP. DAG size: 2804 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:14:31,047 INFO L224 Elim1Store]: Index analysis took 133 ms [2024-11-28 02:14:31,841 INFO L349 Elim1Store]: treesize reduction 196, result has 75.5 percent of original size [2024-11-28 02:14:31,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 321251 treesize of output 299278 [2024-11-28 02:14:44,549 WARN L286 SmtUtils]: Spent 12.70s on a formula simplification that was a NOOP. DAG size: 2851 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:14:44,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:14:44,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 304568 treesize of output 272673 [2024-11-28 02:14:57,273 WARN L286 SmtUtils]: Spent 12.34s on a formula simplification that was a NOOP. DAG size: 2878 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:15:10,307 WARN L286 SmtUtils]: Spent 13.01s on a formula simplification that was a NOOP. DAG size: 2869 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:15:11,741 INFO L349 Elim1Store]: treesize reduction 60, result has 81.3 percent of original size [2024-11-28 02:15:11,745 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 15 new quantified variables, introduced 36 case distinctions, treesize of input 273385 treesize of output 221340 [2024-11-28 02:15:26,405 WARN L286 SmtUtils]: Spent 14.65s on a formula simplification that was a NOOP. DAG size: 2995 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:15:40,717 WARN L286 SmtUtils]: Spent 14.27s on a formula simplification that was a NOOP. DAG size: 2957 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:15:42,045 INFO L349 Elim1Store]: treesize reduction 61, result has 80.7 percent of original size [2024-11-28 02:15:42,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 220031 treesize of output 197471 [2024-11-28 02:15:57,155 WARN L286 SmtUtils]: Spent 15.10s on a formula simplification that was a NOOP. DAG size: 3047 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:16:12,157 WARN L286 SmtUtils]: Spent 14.97s on a formula simplification that was a NOOP. DAG size: 3020 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:16:12,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:16:12,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551705 treesize of output 511874 [2024-11-28 02:17:03,013 WARN L286 SmtUtils]: Spent 50.40s on a formula simplification. DAG size of input: 4733 DAG size of output: 3663 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:03,231 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 29476 treesize of output 27012 [2024-11-28 02:17:23,910 WARN L286 SmtUtils]: Spent 20.67s on a formula simplification that was a NOOP. DAG size: 3662 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:24,051 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 28462 treesize of output 27200 [2024-11-28 02:17:43,554 WARN L286 SmtUtils]: Spent 19.50s on a formula simplification that was a NOOP. DAG size: 3661 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:43,733 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 21550 treesize of output 20370 [2024-11-28 02:18:04,313 WARN L286 SmtUtils]: Spent 20.57s on a formula simplification that was a NOOP. DAG size: 3660 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:48,395 WARN L286 SmtUtils]: Spent 24.48s on a formula simplification that was a NOOP. DAG size: 2100 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:23,784 WARN L286 SmtUtils]: Spent 22.67s on a formula simplification. DAG size of input: 2073 DAG size of output: 2114 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:22:50,943 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 02:22:50,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 02:22:50,945 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 02:22:50,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:22:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:22:51,146 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-11-28 02:22:51,155 INFO L158 Benchmark]: Toolchain (without parser) took 891809.73ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 91.3MB in the beginning and 865.3MB in the end (delta: -774.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-28 02:22:51,156 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:22:51,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.21ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:22:51,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 71.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:22:51,156 INFO L158 Benchmark]: Boogie Preprocessor took 68.08ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 68.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:22:51,157 INFO L158 Benchmark]: RCFGBuilder took 611.99ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 48.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:22:51,157 INFO L158 Benchmark]: TraceAbstraction took 890428.09ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 48.1MB in the beginning and 865.3MB in the end (delta: -817.2MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-28 02:22:51,159 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.21ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 71.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.08ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 68.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 611.99ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 48.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 890428.09ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 48.1MB in the beginning and 865.3MB in the end (delta: -817.2MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB --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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:22:53,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:22:54,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:22:54,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:22:54,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:22:54,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:22:54,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:22:54,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:22:54,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:22:54,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:22:54,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:22:54,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:22:54,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:22:54,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:22:54,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:22:54,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:22:54,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:22:54,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:22:54,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:22:54,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:22:54,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:22:54,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:22:54,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:22:54,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:22:54,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:22:54,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:22:54,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:22:54,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:22:54,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:22:54,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:22:54,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:22:54,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:22:54,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:22:54,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:22:54,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:22:54,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:22:54,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:22:54,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:22:54,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:22:54,125 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_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2024-11-28 02:22:54,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:22:54,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:22:54,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:22:54,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:22:54,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:22:54,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-28 02:22:59,825 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/281faa4e0/9802e52053ad46e3b01183385c5750cb/FLAGf5fcee1f7 [2024-11-28 02:23:00,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:23:00,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-28 02:23:00,187 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/281faa4e0/9802e52053ad46e3b01183385c5750cb/FLAGf5fcee1f7 [2024-11-28 02:23:00,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_def17532-7e45-4390-b1e8-32da2cab755d/bin/uautomizer-verify-aQ6SnzHsRB/data/281faa4e0/9802e52053ad46e3b01183385c5750cb [2024-11-28 02:23:00,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:23:00,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:23:00,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:23:00,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:23:00,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:23:00,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:23:00" (1/1) ... [2024-11-28 02:23:00,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3897fc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:23:00, skipping insertion in model container [2024-11-28 02:23:00,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:23:00" (1/1) ... [2024-11-28 02:23:00,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:23:00,600 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2024-11-28 02:23:00,604 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2024-11-28 02:23:00,605 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2024-11-28 02:23:00,606 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2024-11-28 02:23:00,608 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2024-11-28 02:23:00,609 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2024-11-28 02:23:00,610 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2024-11-28 02:23:00,611 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2024-11-28 02:23:00,612 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2024-11-28 02:23:00,613 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2024-11-28 02:23:00,614 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2024-11-28 02:23:00,615 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2024-11-28 02:23:00,617 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2024-11-28 02:23:00,619 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2024-11-28 02:23:00,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:23:00,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:23:00,703 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2024-11-28 02:23:00,708 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2024-11-28 02:23:00,708 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2024-11-28 02:23:00,709 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2024-11-28 02:23:00,710 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2024-11-28 02:23:00,710 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2024-11-28 02:23:00,713 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2024-11-28 02:23:00,714 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2024-11-28 02:23:00,716 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2024-11-28 02:23:00,718 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2024-11-28 02:23:00,720 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2024-11-28 02:23:00,723 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2024-11-28 02:23:00,725 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2024-11-28 02:23:00,726 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_def17532-7e45-4390-b1e8-32da2cab755d/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2024-11-28 02:23:00,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:23:00,769 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:23:00,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:23:00 WrapperNode [2024-11-28 02:23:00,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:23:00,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:23:00,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:23:00,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized