./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx --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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:12:12,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:12:12,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:12:12,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:12:12,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:12:12,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:12:12,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:12:12,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:12:12,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:12:12,903 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:12:12,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:12:12,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:12:12,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:12:12,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:12:12,906 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:12:12,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:12:12,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:12:12,908 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:12:12,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:12:12,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:12:12,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:12:12,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:12:12,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:12:12,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:12:12,912 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:12:12,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:12:12,913 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:12:12,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:12:12,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:12:12,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:12:12,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:12:12,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:12,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:12:12,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:12:12,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:12:12,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:12:12,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:12:12,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:12:12,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:12:12,917 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:12:12,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:12:12,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:12:12,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2023-11-21 22:12:13,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:12:13,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:12:13,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:12:13,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:12:13,271 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:12:13,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/heap-data/packet_filter.i [2023-11-21 22:12:16,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:12:16,742 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:12:16,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/sv-benchmarks/c/heap-data/packet_filter.i [2023-11-21 22:12:16,759 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/data/295090e15/e49df7e792a740d8adfa8d630bfe7e1a/FLAG5f2cca9e9 [2023-11-21 22:12:16,774 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/data/295090e15/e49df7e792a740d8adfa8d630bfe7e1a [2023-11-21 22:12:16,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:12:16,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:12:16,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:16,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:12:16,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:12:16,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:16" (1/1) ... [2023-11-21 22:12:16,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2ae3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:16, skipping insertion in model container [2023-11-21 22:12:16,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:16" (1/1) ... [2023-11-21 22:12:16,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:12:17,210 WARN L240 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_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2023-11-21 22:12:17,224 WARN L240 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_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2023-11-21 22:12:17,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:17,253 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:12:17,329 WARN L240 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_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2023-11-21 22:12:17,336 WARN L240 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_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2023-11-21 22:12:17,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:17,374 WARN L675 CHandler]: The function __VERIFIER_nondet_charp is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:12:17,382 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:12:17,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17 WrapperNode [2023-11-21 22:12:17,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:17,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:17,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:12:17,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:12:17,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,477 INFO L138 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-11-21 22:12:17,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:17,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:12:17,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:12:17,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:12:17,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,514 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,554 INFO L187 HeapSplitter]: Split 57 memory accesses to 7 slices as follows [2, 6, 16, 6, 6, 15, 6] [2023-11-21 22:12:17,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:12:17,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:12:17,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:12:17,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:12:17,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (1/1) ... [2023-11-21 22:12:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:17,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:12:17,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:12:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:12:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:12:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:12:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 22:12:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-21 22:12:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-21 22:12:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-21 22:12:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:12:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:12:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:12:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 22:12:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 22:12:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-21 22:12:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-21 22:12:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:12:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:12:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2023-11-21 22:12:17,692 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2023-11-21 22:12:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:12:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:12:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 22:12:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-21 22:12:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-21 22:12:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-21 22:12:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-21 22:12:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:12:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:12:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:12:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 22:12:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-21 22:12:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-21 22:12:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-21 22:12:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-21 22:12:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2023-11-21 22:12:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure send [2023-11-21 22:12:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2023-11-21 22:12:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:12:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-21 22:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 22:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-21 22:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-21 22:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:12:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:12:17,915 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:12:17,918 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:12:18,293 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:12:18,411 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:12:18,411 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:12:18,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:18 BoogieIcfgContainer [2023-11-21 22:12:18,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:12:18,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:12:18,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:12:18,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:12:18,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:12:16" (1/3) ... [2023-11-21 22:12:18,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3d97c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:18, skipping insertion in model container [2023-11-21 22:12:18,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:17" (2/3) ... [2023-11-21 22:12:18,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3d97c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:18, skipping insertion in model container [2023-11-21 22:12:18,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:18" (3/3) ... [2023-11-21 22:12:18,425 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2023-11-21 22:12:18,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:12:18,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 22:12:18,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:12:18,496 INFO L357 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, mHoare=true, 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;@a852727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:12:18,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 22:12:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:12:18,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:18,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:12:18,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:18,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 385097994, now seen corresponding path program 1 times [2023-11-21 22:12:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008629371] [2023-11-21 22:12:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008629371] [2023-11-21 22:12:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008629371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:18,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:12:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766818169] [2023-11-21 22:12:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:18,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:12:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:12:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:12:18,778 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2023-11-21 22:12:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:18,849 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2023-11-21 22:12:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:12:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 [2023-11-21 22:12:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:18,860 INFO L225 Difference]: With dead ends: 51 [2023-11-21 22:12:18,860 INFO L226 Difference]: Without dead ends: 32 [2023-11-21 22:12:18,863 INFO L412 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 [2023-11-21 22:12:18,868 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:18,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:12:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-21 22:12:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-21 22:12:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-11-21 22:12:18,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 6 [2023-11-21 22:12:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:18,918 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-21 22:12:18,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2023-11-21 22:12:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-11-21 22:12:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 22:12:18,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:18,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:18,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:12:18,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:18,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1923933883, now seen corresponding path program 1 times [2023-11-21 22:12:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696133115] [2023-11-21 22:12:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696133115] [2023-11-21 22:12:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696133115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:19,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:12:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497346649] [2023-11-21 22:12:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:19,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:12:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:12:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:12:19,170 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:12:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:19,378 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-11-21 22:12:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:12:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-21 22:12:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:19,382 INFO L225 Difference]: With dead ends: 65 [2023-11-21 22:12:19,382 INFO L226 Difference]: Without dead ends: 49 [2023-11-21 22:12:19,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:12:19,384 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:19,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:12:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-21 22:12:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2023-11-21 22:12:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2023-11-21 22:12:19,397 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 7 [2023-11-21 22:12:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:19,397 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2023-11-21 22:12:19,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:12:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2023-11-21 22:12:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:12:19,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:19,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:19,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:12:19,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:19,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash 487604392, now seen corresponding path program 1 times [2023-11-21 22:12:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661790577] [2023-11-21 22:12:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661790577] [2023-11-21 22:12:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661790577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:12:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657685041] [2023-11-21 22:12:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:19,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:12:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:12:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:12:19,520 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:12:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:19,790 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2023-11-21 22:12:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:12:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-21 22:12:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:19,794 INFO L225 Difference]: With dead ends: 53 [2023-11-21 22:12:19,794 INFO L226 Difference]: Without dead ends: 41 [2023-11-21 22:12:19,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:12:19,800 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:19,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:12:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-21 22:12:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-11-21 22:12:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-11-21 22:12:19,829 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 8 [2023-11-21 22:12:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:19,829 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-21 22:12:19,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:12:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2023-11-21 22:12:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 22:12:19,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:19,833 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:19,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:12:19,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:19,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 533872896, now seen corresponding path program 1 times [2023-11-21 22:12:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757198791] [2023-11-21 22:12:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:12:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757198791] [2023-11-21 22:12:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757198791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 22:12:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476779077] [2023-11-21 22:12:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:12:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:12:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:12:22,070 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:23,573 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2023-11-21 22:12:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:12:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-21 22:12:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:23,576 INFO L225 Difference]: With dead ends: 61 [2023-11-21 22:12:23,578 INFO L226 Difference]: Without dead ends: 59 [2023-11-21 22:12:23,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-21 22:12:23,581 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:23,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 166 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-21 22:12:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-21 22:12:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2023-11-21 22:12:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-11-21 22:12:23,598 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2023-11-21 22:12:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:23,598 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-11-21 22:12:23,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-11-21 22:12:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:12:23,600 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:23,600 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:23,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:12:23,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:23,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -629796787, now seen corresponding path program 1 times [2023-11-21 22:12:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105596276] [2023-11-21 22:12:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:12:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105596276] [2023-11-21 22:12:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105596276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:12:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605067650] [2023-11-21 22:12:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:24,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:12:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:12:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:12:24,076 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:24,579 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2023-11-21 22:12:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:12:24,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-21 22:12:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:24,581 INFO L225 Difference]: With dead ends: 70 [2023-11-21 22:12:24,581 INFO L226 Difference]: Without dead ends: 61 [2023-11-21 22:12:24,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:12:24,582 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:24,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:12:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-21 22:12:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2023-11-21 22:12:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:12:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-11-21 22:12:24,593 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 17 [2023-11-21 22:12:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:24,593 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-11-21 22:12:24,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-11-21 22:12:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:12:24,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:24,595 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:12:24,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:24,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1655019238, now seen corresponding path program 1 times [2023-11-21 22:12:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185123744] [2023-11-21 22:12:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:12:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185123744] [2023-11-21 22:12:25,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185123744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:25,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807800528] [2023-11-21 22:12:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:25,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:25,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:25,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:12:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:25,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-21 22:12:25,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:25,537 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 10 treesize of output 8 [2023-11-21 22:12:27,794 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (or (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_#memory_$Pointer$#3.base|))) (and (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#3.base| .cse0)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))))))) is different from false [2023-11-21 22:12:27,813 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (or (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_#memory_$Pointer$#3.base|))) (and (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#3.base| .cse0)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))))))) is different from true [2023-11-21 22:12:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:27,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:12:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807800528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:27,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:12:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2023-11-21 22:12:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990149772] [2023-11-21 22:12:27,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:12:27,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:12:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:12:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=5, NotChecked=14, Total=90 [2023-11-21 22:12:27,987 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 22:12:28,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse0 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (or .cse0 (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_#memory_$Pointer$#3.base|))) (and (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#3.base| .cse1)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))))))) is different from false [2023-11-21 22:12:28,243 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse0 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (or .cse0 (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_#memory_$Pointer$#3.base|))) (and (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#3.base| .cse1)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))))))) is different from true [2023-11-21 22:12:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:28,356 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2023-11-21 22:12:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:12:28,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-21 22:12:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:28,358 INFO L225 Difference]: With dead ends: 89 [2023-11-21 22:12:28,358 INFO L226 Difference]: Without dead ends: 73 [2023-11-21 22:12:28,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=28, Invalid=63, Unknown=7, NotChecked=34, Total=132 [2023-11-21 22:12:28,359 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:28,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 173 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2023-11-21 22:12:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-21 22:12:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2023-11-21 22:12:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:12:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2023-11-21 22:12:28,372 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 17 [2023-11-21 22:12:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:28,373 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2023-11-21 22:12:28,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 22:12:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2023-11-21 22:12:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:12:28,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:28,374 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:28,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:12:28,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:28,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:28,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1933779810, now seen corresponding path program 1 times [2023-11-21 22:12:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:28,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261285121] [2023-11-21 22:12:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:12:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261285121] [2023-11-21 22:12:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261285121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 22:12:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60283706] [2023-11-21 22:12:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:12:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:12:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:12:29,974 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:30,955 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2023-11-21 22:12:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:12:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-21 22:12:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:30,958 INFO L225 Difference]: With dead ends: 69 [2023-11-21 22:12:30,958 INFO L226 Difference]: Without dead ends: 67 [2023-11-21 22:12:30,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-11-21 22:12:30,959 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:30,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 228 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-21 22:12:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-21 22:12:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2023-11-21 22:12:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:12:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2023-11-21 22:12:30,974 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 17 [2023-11-21 22:12:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:30,974 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2023-11-21 22:12:30,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2023-11-21 22:12:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 22:12:30,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:30,978 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:30,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:12:30,979 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:30,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 234023795, now seen corresponding path program 1 times [2023-11-21 22:12:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914037858] [2023-11-21 22:12:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:12:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914037858] [2023-11-21 22:12:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914037858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 22:12:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701105736] [2023-11-21 22:12:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:12:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:12:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:12:32,811 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:33,713 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-11-21 22:12:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:12:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-21 22:12:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:33,715 INFO L225 Difference]: With dead ends: 70 [2023-11-21 22:12:33,715 INFO L226 Difference]: Without dead ends: 68 [2023-11-21 22:12:33,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-21 22:12:33,716 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:33,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 290 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-21 22:12:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-21 22:12:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2023-11-21 22:12:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:12:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2023-11-21 22:12:33,739 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 18 [2023-11-21 22:12:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:33,740 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2023-11-21 22:12:33,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:12:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2023-11-21 22:12:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 22:12:33,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:33,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:12:33,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:33,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1782285027, now seen corresponding path program 1 times [2023-11-21 22:12:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624942403] [2023-11-21 22:12:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:12:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-21 22:12:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624942403] [2023-11-21 22:12:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624942403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:35,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663792312] [2023-11-21 22:12:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:35,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:35,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:35,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:12:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:35,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-21 22:12:35,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:35,527 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 30 treesize of output 31 [2023-11-21 22:12:35,535 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 11 [2023-11-21 22:12:35,548 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 34 treesize of output 15 [2023-11-21 22:12:35,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-21 22:12:35,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-21 22:12:35,669 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 18 [2023-11-21 22:12:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:35,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:12:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663792312] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:12:36,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:12:36,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-21 22:12:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31345885] [2023-11-21 22:12:36,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:12:36,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-21 22:12:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:36,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 22:12:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-21 22:12:36,300 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-21 22:12:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:37,706 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2023-11-21 22:12:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:12:37,707 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 23 [2023-11-21 22:12:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:37,708 INFO L225 Difference]: With dead ends: 100 [2023-11-21 22:12:37,708 INFO L226 Difference]: Without dead ends: 84 [2023-11-21 22:12:37,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-11-21 22:12:37,709 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:37,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 309 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-21 22:12:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-21 22:12:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-11-21 22:12:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.293103448275862) internal successors, (75), 59 states have internal predecessors, (75), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-21 22:12:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2023-11-21 22:12:37,733 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 23 [2023-11-21 22:12:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:37,734 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-11-21 22:12:37,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-21 22:12:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2023-11-21 22:12:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:12:37,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:37,740 INFO L195 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] [2023-11-21 22:12:37,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:12:37,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:37,961 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:37,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -583726390, now seen corresponding path program 1 times [2023-11-21 22:12:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445849724] [2023-11-21 22:12:37,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:12:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-21 22:12:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:12:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445849724] [2023-11-21 22:12:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445849724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248982323] [2023-11-21 22:12:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:38,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:38,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:12:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:38,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 22:12:38,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:38,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-21 22:12:41,112 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#3.offset|))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#3.offset| .cse0))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2023-11-21 22:12:41,115 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#3.offset|))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#3.offset| .cse0))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from true [2023-11-21 22:12:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:12:41,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:12:41,418 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1205 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1204 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1204) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2023-11-21 22:12:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248982323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:41,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:12:41,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-21 22:12:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99069131] [2023-11-21 22:12:41,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:12:41,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:12:41,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:41,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:12:41,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=52, Unknown=3, NotChecked=30, Total=110 [2023-11-21 22:12:41,422 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 22:12:41,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#3.offset|))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#3.offset| .cse0))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse1)) is different from false [2023-11-21 22:12:41,690 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#3.offset|))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#3.offset| .cse0))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse1)) is different from true [2023-11-21 22:12:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:41,995 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2023-11-21 22:12:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:12:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-21 22:12:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:41,999 INFO L225 Difference]: With dead ends: 133 [2023-11-21 22:12:42,000 INFO L226 Difference]: Without dead ends: 108 [2023-11-21 22:12:42,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=37, Invalid=80, Unknown=5, NotChecked=60, Total=182 [2023-11-21 22:12:42,002 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:42,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 188 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2023-11-21 22:12:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-21 22:12:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-11-21 22:12:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.32) internal successors, (99), 76 states have internal predecessors, (99), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-21 22:12:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2023-11-21 22:12:42,045 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 24 [2023-11-21 22:12:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:42,045 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2023-11-21 22:12:42,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 22:12:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2023-11-21 22:12:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 22:12:42,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:42,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:42,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-21 22:12:42,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-21 22:12:42,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:42,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -201714198, now seen corresponding path program 1 times [2023-11-21 22:12:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:42,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094011977] [2023-11-21 22:12:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:12:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 22:12:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094011977] [2023-11-21 22:12:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094011977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045932889] [2023-11-21 22:12:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:43,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:43,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:12:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:43,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-21 22:12:43,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:44,055 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 30 treesize of output 31 [2023-11-21 22:12:44,062 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 34 treesize of output 15 [2023-11-21 22:12:44,069 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 11 [2023-11-21 22:12:44,087 WARN L876 $PredicateComparison]: unable to prove that (exists ((append_to_queue_~q.offset Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$#3.base)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#3.offset)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_append_to_queue_#in~q.base|) append_to_queue_~q.offset))) (and (= (store |c_old(#memory_$Pointer$#3.base)| |c_append_to_queue_#in~q.base| (store .cse0 append_to_queue_~q.offset .cse1)) |c_#memory_$Pointer$#3.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 12) (select .cse0 append_to_queue_~q.offset)) (= (store |c_old(#memory_$Pointer$#3.offset)| |c_append_to_queue_#in~q.base| (store .cse2 append_to_queue_~q.offset 0)) |c_#memory_$Pointer$#3.offset|) (= (select .cse2 append_to_queue_~q.offset) (select (select |c_#memory_$Pointer$#2.offset| .cse1) 12))))) is different from true [2023-11-21 22:12:44,131 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2023-11-21 22:12:44,132 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2023-11-21 22:12:44,171 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-21 22:12:44,171 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2023-11-21 22:12:44,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:12:44,776 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 106 treesize of output 102 [2023-11-21 22:12:44,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:12:44,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2023-11-21 22:12:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:45,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:12:46,096 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 225 treesize of output 205 [2023-11-21 22:12:46,108 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 152 treesize of output 148 [2023-11-21 22:12:46,118 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 528 treesize of output 488 [2023-11-21 22:12:46,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:12:46,399 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 76 treesize of output 56 [2023-11-21 22:12:46,424 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 182 treesize of output 162 [2023-11-21 22:12:46,511 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 186 treesize of output 166 [2023-11-21 22:12:46,520 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 26 [2023-11-21 22:12:46,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:12:46,615 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 80 treesize of output 60 [2023-11-21 22:12:46,622 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 26 [2023-11-21 22:12:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045932889] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:12:46,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:12:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-11-21 22:12:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484462303] [2023-11-21 22:12:46,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:12:46,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 22:12:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:12:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2023-11-21 22:12:46,824 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:12:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:47,941 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2023-11-21 22:12:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:12:47,941 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-21 22:12:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:47,942 INFO L225 Difference]: With dead ends: 119 [2023-11-21 22:12:47,943 INFO L226 Difference]: Without dead ends: 102 [2023-11-21 22:12:47,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=454, Unknown=1, NotChecked=44, Total=600 [2023-11-21 22:12:47,944 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:47,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 323 Invalid, 0 Unknown, 96 Unchecked, 0.8s Time] [2023-11-21 22:12:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-21 22:12:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2023-11-21 22:12:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.318840579710145) internal successors, (91), 70 states have internal predecessors, (91), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-21 22:12:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2023-11-21 22:12:47,969 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 25 [2023-11-21 22:12:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:47,970 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2023-11-21 22:12:47,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:12:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2023-11-21 22:12:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 22:12:47,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:47,972 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:48,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:12:48,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-21 22:12:48,185 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:48,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash -144481515, now seen corresponding path program 1 times [2023-11-21 22:12:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:48,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180220074] [2023-11-21 22:12:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:50,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:12:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-21 22:12:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:12:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180220074] [2023-11-21 22:12:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180220074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406006436] [2023-11-21 22:12:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:51,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:51,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:12:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:51,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-21 22:12:51,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:51,726 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 10 treesize of output 8 [2023-11-21 22:12:51,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2023-11-21 22:12:51,752 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 60 treesize of output 50 [2023-11-21 22:12:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 69 [2023-11-21 22:12:51,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:12:51,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2023-11-21 22:12:51,901 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 40 treesize of output 16 [2023-11-21 22:12:51,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:12:51,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:12:51,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2023-11-21 22:12:51,951 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-11-21 22:12:51,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 21 [2023-11-21 22:12:52,074 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:12:52,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 22:12:52,174 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:12:52,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2023-11-21 22:12:52,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:12:52,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:12:52,210 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-11-21 22:12:52,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-21 22:12:52,304 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 29 treesize of output 17 [2023-11-21 22:12:52,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-21 22:12:52,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:12:52,448 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 37 treesize of output 28 [2023-11-21 22:12:52,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:12:52,465 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:12:52,465 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 23 treesize of output 23 [2023-11-21 22:12:52,471 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 20 treesize of output 15 [2023-11-21 22:12:52,479 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 [2023-11-21 22:12:52,509 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 19 treesize of output 11 [2023-11-21 22:12:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:52,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:12:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406006436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:52,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:12:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2023-11-21 22:12:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993332004] [2023-11-21 22:12:52,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:12:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-21 22:12:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-21 22:12:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=514, Unknown=1, NotChecked=0, Total=600 [2023-11-21 22:12:52,963 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 22:12:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:55,959 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2023-11-21 22:12:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:12:55,960 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-11-21 22:12:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:55,963 INFO L225 Difference]: With dead ends: 172 [2023-11-21 22:12:55,964 INFO L226 Difference]: Without dead ends: 170 [2023-11-21 22:12:55,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=1366, Unknown=1, NotChecked=0, Total=1640 [2023-11-21 22:12:55,966 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 117 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:55,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 300 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-21 22:12:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-21 22:12:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2023-11-21 22:12:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 87 states have internal predecessors, (116), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-21 22:12:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2023-11-21 22:12:56,009 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 26 [2023-11-21 22:12:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:56,009 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2023-11-21 22:12:56,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 22:12:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2023-11-21 22:12:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-21 22:12:56,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:56,012 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:56,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:12:56,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:56,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:56,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash 101954223, now seen corresponding path program 2 times [2023-11-21 22:12:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035854038] [2023-11-21 22:12:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:12:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-21 22:12:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 22:12:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035854038] [2023-11-21 22:12:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035854038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:12:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60131369] [2023-11-21 22:12:57,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:12:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:57,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:57,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b414deb7-14d4-4d6b-8df0-ec9295d7bb20/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:12:57,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:12:57,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:12:57,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-21 22:12:57,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:12:57,684 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 10 treesize of output 8 [2023-11-21 22:12:59,972 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_#memory_$Pointer$#3.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| .cse0 (select |c_#memory_$Pointer$#3.base| .cse0)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))) .cse1) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) .cse1) (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_#memory_$Pointer$#3.base|))) (and (exists ((|v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= .cse3 .cse2) (= (select (select |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| .cse3 (select |c_#memory_$Pointer$#3.base| .cse3)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from false [2023-11-21 22:12:59,979 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_#memory_$Pointer$#3.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| .cse0 (select |c_#memory_$Pointer$#3.base| .cse0)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))) .cse1) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) .cse1) (exists ((|v_#memory_$Pointer$#3.base_BEFORE_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_#memory_$Pointer$#3.base|))) (and (exists ((|v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= .cse3 .cse2) (= (select (select |v_old(#memory_$Pointer$#3.offset)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| .cse3 (select |c_#memory_$Pointer$#3.base| .cse3)) |c_#memory_$Pointer$#3.base|) (= (select (select |v_#memory_$Pointer$#3.base_BEFORE_CALL_19| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from true [2023-11-21 22:13:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2023-11-21 22:13:00,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:13:00,162 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2261 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2261) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2260 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2260) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2023-11-21 22:13:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60131369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:13:00,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:13:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2023-11-21 22:13:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678593164] [2023-11-21 22:13:00,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:13:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:13:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:13:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:13:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=40, Unknown=3, NotChecked=26, Total=90 [2023-11-21 22:13:00,166 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3)