./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/packet_filter.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:29:50,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:29:50,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:29:50,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:29:50,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:29:50,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:29:50,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:29:50,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:29:50,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:29:50,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:29:50,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:29:50,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:29:50,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:29:50,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:29:50,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:29:50,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:29:50,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:29:50,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:29:50,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:29:50,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:29:50,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:29:50,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:29:50,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:29:50,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:29:50,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:29:50,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:29:50,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:29:50,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:29:50,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:29:50,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:29:50,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:29:50,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:29:50,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:29:50,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:29:50,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:29:50,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:29:50,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:29:50,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:29:50,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:29:50,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:29:50,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:29:50,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:29:50,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2024-11-11 19:29:50,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:29:50,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:29:50,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:29:50,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:29:50,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:29:50,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2024-11-11 19:29:51,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:29:52,095 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:29:52,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-11 19:29:52,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01830dc7/d3eb2ceb47c1494f87e95b01a30c4457/FLAGaed8793b2 [2024-11-11 19:29:52,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01830dc7/d3eb2ceb47c1494f87e95b01a30c4457 [2024-11-11 19:29:52,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:29:52,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:29:52,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:29:52,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:29:52,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:29:52,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7859ca03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52, skipping insertion in model container [2024-11-11 19:29:52,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:29:52,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2024-11-11 19:29:52,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2024-11-11 19:29:52,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:29:52,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:29:52,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2024-11-11 19:29:52,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2024-11-11 19:29:52,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:29:52,630 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:29:52,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52 WrapperNode [2024-11-11 19:29:52,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:29:52,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:29:52,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:29:52,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:29:52,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,693 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-11-11 19:29:52,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:29:52,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:29:52,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:29:52,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:29:52,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,735 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [6, 2, 6, 16, 15, 6, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [0, 2, 0, 0, 3, 2, 0]. The 14 writes are split as follows [3, 0, 3, 4, 0, 1, 3]. [2024-11-11 19:29:52,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:29:52,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:29:52,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:29:52,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:29:52,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (1/1) ... [2024-11-11 19:29:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:29:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:52,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:29:52,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:29:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:29:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-11 19:29:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:29:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:29:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:29:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 19:29:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-11 19:29:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-11-11 19:29:52,861 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:29:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-11 19:29:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-11 19:29:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-11-11 19:29:52,864 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 19:29:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 19:29:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 19:29:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:29:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:29:53,040 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:29:53,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:29:53,405 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-11 19:29:53,405 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:29:53,422 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:29:53,423 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 19:29:53,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:29:53 BoogieIcfgContainer [2024-11-11 19:29:53,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:29:53,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:29:53,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:29:53,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:29:53,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:29:52" (1/3) ... [2024-11-11 19:29:53,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76610f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:29:53, skipping insertion in model container [2024-11-11 19:29:53,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:29:52" (2/3) ... [2024-11-11 19:29:53,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76610f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:29:53, skipping insertion in model container [2024-11-11 19:29:53,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:29:53" (3/3) ... [2024-11-11 19:29:53,432 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-11-11 19:29:53,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:29:53,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 19:29:53,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:29:53,514 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51549fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:29:53,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 19:29:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 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) [2024-11-11 19:29:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:29:53,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:53,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:53,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:53,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1092262807, now seen corresponding path program 1 times [2024-11-11 19:29:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803522857] [2024-11-11 19:29:53,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803522857] [2024-11-11 19:29:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803522857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:53,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:53,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:29:53,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702890397] [2024-11-11 19:29:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:29:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:29:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:29:53,715 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:53,732 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-11 19:29:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:29:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 19:29:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:53,738 INFO L225 Difference]: With dead ends: 76 [2024-11-11 19:29:53,738 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 19:29:53,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:29:53,743 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:53,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:29:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 19:29:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 19:29:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 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) [2024-11-11 19:29:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-11 19:29:53,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2024-11-11 19:29:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:53,775 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-11 19:29:53,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-11 19:29:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:29:53,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:53,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:29:53,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:53,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 353124844, now seen corresponding path program 1 times [2024-11-11 19:29:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595549628] [2024-11-11 19:29:53,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595549628] [2024-11-11 19:29:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595549628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:54,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:29:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150873105] [2024-11-11 19:29:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:29:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:29:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,005 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:54,080 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-11 19:29:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:29:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 19:29:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:54,084 INFO L225 Difference]: With dead ends: 77 [2024-11-11 19:29:54,084 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 19:29:54,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,086 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:54,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 19:29:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-11 19:29:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 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) [2024-11-11 19:29:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-11 19:29:54,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 9 [2024-11-11 19:29:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:54,096 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-11 19:29:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-11 19:29:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 19:29:54,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:54,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:54,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:29:54,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:54,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 380446450, now seen corresponding path program 1 times [2024-11-11 19:29:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466975290] [2024-11-11 19:29:54,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466975290] [2024-11-11 19:29:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466975290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:54,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:29:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036138685] [2024-11-11 19:29:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:29:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:29:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,241 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:54,302 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-11 19:29:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:29:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-11 19:29:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:54,303 INFO L225 Difference]: With dead ends: 69 [2024-11-11 19:29:54,304 INFO L226 Difference]: Without dead ends: 52 [2024-11-11 19:29:54,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,306 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:54,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:29:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-11 19:29:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-11 19:29:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 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) [2024-11-11 19:29:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-11 19:29:54,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 12 [2024-11-11 19:29:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:54,320 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-11 19:29:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-11 19:29:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:29:54,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:54,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:29:54,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 707816306, now seen corresponding path program 1 times [2024-11-11 19:29:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129616203] [2024-11-11 19:29:54,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:29:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:29:54,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129616203] [2024-11-11 19:29:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129616203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:29:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390326022] [2024-11-11 19:29:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:54,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:29:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:29:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,527 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-11 19:29:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:54,605 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-11 19:29:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:29:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2024-11-11 19:29:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:54,607 INFO L225 Difference]: With dead ends: 50 [2024-11-11 19:29:54,607 INFO L226 Difference]: Without dead ends: 48 [2024-11-11 19:29:54,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:54,608 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:54,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-11 19:29:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-11 19:29:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 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) [2024-11-11 19:29:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-11 19:29:54,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-11-11 19:29:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:54,615 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-11 19:29:54,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-11 19:29:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-11 19:29:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:29:54,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:54,616 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:29:54,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 707818228, now seen corresponding path program 1 times [2024-11-11 19:29:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71762114] [2024-11-11 19:29:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:29:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:56,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:56,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71762114] [2024-11-11 19:29:56,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71762114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:56,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:56,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 19:29:56,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930614138] [2024-11-11 19:29:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:56,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:29:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:29:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:29:56,224 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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) [2024-11-11 19:29:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:57,025 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-11-11 19:29:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 19:29:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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 20 [2024-11-11 19:29:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:57,027 INFO L225 Difference]: With dead ends: 93 [2024-11-11 19:29:57,027 INFO L226 Difference]: Without dead ends: 69 [2024-11-11 19:29:57,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:29:57,029 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:57,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 288 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 19:29:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-11 19:29:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2024-11-11 19:29:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 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) [2024-11-11 19:29:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-11 19:29:57,036 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2024-11-11 19:29:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:57,037 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-11 19:29:57,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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) [2024-11-11 19:29:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-11 19:29:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:29:57,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:57,038 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:29:57,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -626681606, now seen corresponding path program 1 times [2024-11-11 19:29:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954986713] [2024-11-11 19:29:57,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:29:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954986713] [2024-11-11 19:29:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954986713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872004204] [2024-11-11 19:29:57,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:57,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:57,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:29:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:57,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 19:29:57,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:57,730 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 [2024-11-11 19:29:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:57,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:58,053 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_449 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2024-11-11 19:29:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872004204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:58,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:29:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2024-11-11 19:29:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793564292] [2024-11-11 19:29:58,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:29:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:29:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-11-11 19:29:58,058 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:29:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:58,276 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2024-11-11 19:29:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:29:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-11 19:29:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:58,278 INFO L225 Difference]: With dead ends: 93 [2024-11-11 19:29:58,278 INFO L226 Difference]: Without dead ends: 69 [2024-11-11 19:29:58,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-11-11 19:29:58,279 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:58,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:29:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-11 19:29:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-11 19:29:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 58 states have internal predecessors, (74), 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) [2024-11-11 19:29:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-11 19:29:58,289 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 21 [2024-11-11 19:29:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:58,290 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-11 19:29:58,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:29:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-11 19:29:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:29:58,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:58,292 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:58,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:29:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 19:29:58,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1015269178, now seen corresponding path program 1 times [2024-11-11 19:29:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496636500] [2024-11-11 19:29:58,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:29:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496636500] [2024-11-11 19:29:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496636500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:59,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 19:29:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055552570] [2024-11-11 19:29:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:59,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:29:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:29:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:29:59,369 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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) [2024-11-11 19:29:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:59,850 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2024-11-11 19:29:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:29:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 21 [2024-11-11 19:29:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:59,851 INFO L225 Difference]: With dead ends: 88 [2024-11-11 19:29:59,852 INFO L226 Difference]: Without dead ends: 86 [2024-11-11 19:29:59,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:29:59,854 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:59,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:29:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-11 19:29:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-11 19:29:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 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) [2024-11-11 19:29:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-11 19:29:59,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 21 [2024-11-11 19:29:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:59,873 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-11 19:29:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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) [2024-11-11 19:29:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-11 19:29:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:29:59,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:59,874 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:29:59,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1374242732, now seen corresponding path program 1 times [2024-11-11 19:29:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335673132] [2024-11-11 19:29:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335673132] [2024-11-11 19:30:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335673132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:30:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414831845] [2024-11-11 19:30:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:00,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:00,138 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-11-11 19:30:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:00,383 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2024-11-11 19:30:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:30:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2024-11-11 19:30:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:00,384 INFO L225 Difference]: With dead ends: 100 [2024-11-11 19:30:00,385 INFO L226 Difference]: Without dead ends: 86 [2024-11-11 19:30:00,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:00,385 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:00,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-11 19:30:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-11 19:30:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 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) [2024-11-11 19:30:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-11 19:30:00,399 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 23 [2024-11-11 19:30:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:00,400 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-11 19:30:00,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-11-11 19:30:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-11 19:30:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:30:00,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:00,404 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:00,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 19:30:00,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -493020186, now seen corresponding path program 1 times [2024-11-11 19:30:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476530829] [2024-11-11 19:30:00,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:30:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476530829] [2024-11-11 19:30:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476530829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 19:30:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818254824] [2024-11-11 19:30:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 19:30:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 19:30:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:30:01,109 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) [2024-11-11 19:30:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:01,544 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2024-11-11 19:30:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 19:30:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 24 [2024-11-11 19:30:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:01,548 INFO L225 Difference]: With dead ends: 107 [2024-11-11 19:30:01,548 INFO L226 Difference]: Without dead ends: 105 [2024-11-11 19:30:01,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:30:01,549 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 25 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:01,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 488 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:30:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-11 19:30:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-11 19:30:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 19:30:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-11-11 19:30:01,566 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 24 [2024-11-11 19:30:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:01,566 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-11-11 19:30:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) [2024-11-11 19:30:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-11-11 19:30:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:30:01,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:01,568 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:01,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 19:30:01,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -493018264, now seen corresponding path program 1 times [2024-11-11 19:30:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302119775] [2024-11-11 19:30:01,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:30:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302119775] [2024-11-11 19:30:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302119775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 19:30:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006857500] [2024-11-11 19:30:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:02,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 19:30:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:02,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 19:30:02,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:30:02,593 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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) [2024-11-11 19:30:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:03,420 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2024-11-11 19:30:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 19:30:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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 24 [2024-11-11 19:30:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:03,421 INFO L225 Difference]: With dead ends: 119 [2024-11-11 19:30:03,421 INFO L226 Difference]: Without dead ends: 107 [2024-11-11 19:30:03,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-11 19:30:03,423 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:03,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 561 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 19:30:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-11 19:30:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-11-11 19:30:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 78 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 19:30:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2024-11-11 19:30:03,433 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 24 [2024-11-11 19:30:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:03,437 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2024-11-11 19:30:03,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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) [2024-11-11 19:30:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2024-11-11 19:30:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 19:30:03,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:03,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:03,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:30:03,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:03,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash -854763749, now seen corresponding path program 1 times [2024-11-11 19:30:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399413456] [2024-11-11 19:30:03,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:04,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:30:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399413456] [2024-11-11 19:30:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399413456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207718076] [2024-11-11 19:30:04,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:04,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:04,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:30:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:04,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-11 19:30:04,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:04,622 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 [2024-11-11 19:30:04,630 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 [2024-11-11 19:30:04,636 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 [2024-11-11 19:30:04,653 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_21 Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$#5.base)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#5.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_21)) (.cse2 (select |c_old(#memory_$Pointer$#5.offset)| |c_append_to_queue_#in~q.base|))) (and (= (store |c_old(#memory_$Pointer$#5.base)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_21 .cse1)) |c_#memory_$Pointer$#5.base|) (= (select .cse2 v_append_to_queue_~q.offset_21) (select (select |c_#memory_$Pointer$#3.offset| .cse1) 12)) (= (select .cse0 v_append_to_queue_~q.offset_21) (select (select |c_#memory_$Pointer$#3.base| .cse1) 12)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_21 0)) |c_#memory_$Pointer$#5.offset|)))) is different from true [2024-11-11 19:30:04,706 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-11 19:30:04,706 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 [2024-11-11 19:30:04,734 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-11 19:30:04,735 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 [2024-11-11 19:30:05,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:05,144 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 [2024-11-11 19:30:05,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:05,180 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 [2024-11-11 19:30:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:06,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:06,317 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 [2024-11-11 19:30:06,328 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 [2024-11-11 19:30:06,343 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 292 treesize of output 272 [2024-11-11 19:30:06,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:06,623 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 [2024-11-11 19:30:06,642 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 426 treesize of output 386 [2024-11-11 19:30:06,651 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 112 treesize of output 108 [2024-11-11 19:30:06,726 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 [2024-11-11 19:30:06,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:06,818 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 [2024-11-11 19:30:06,822 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 [2024-11-11 19:30:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207718076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:06,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 19 [2024-11-11 19:30:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832949828] [2024-11-11 19:30:06,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:06,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:30:06,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:30:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2024-11-11 19:30:06,999 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:30:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:07,744 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2024-11-11 19:30:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 19:30:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-11 19:30:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:07,746 INFO L225 Difference]: With dead ends: 173 [2024-11-11 19:30:07,746 INFO L226 Difference]: Without dead ends: 149 [2024-11-11 19:30:07,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-11 19:30:07,747 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:07,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 476 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 255 Invalid, 0 Unknown, 131 Unchecked, 0.5s Time] [2024-11-11 19:30:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-11 19:30:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2024-11-11 19:30:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 113 states have internal predecessors, (143), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 19:30:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-11-11 19:30:07,769 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 30 [2024-11-11 19:30:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-11-11 19:30:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:30:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-11-11 19:30:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 19:30:07,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:07,770 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:07,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:30:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 19:30:07,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:07,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 778676608, now seen corresponding path program 1 times [2024-11-11 19:30:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105758611] [2024-11-11 19:30:07,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:30:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105758611] [2024-11-11 19:30:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105758611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360341428] [2024-11-11 19:30:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:10,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:10,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:10,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:30:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-11 19:30:10,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:10,385 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 [2024-11-11 19:30:10,492 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 [2024-11-11 19:30:10,510 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 [2024-11-11 19:30:10,518 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 42 treesize of output 35 [2024-11-11 19:30:10,536 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-11 19:30:10,536 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 [2024-11-11 19:30:10,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 11 [2024-11-11 19:30:10,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:30:10,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:10,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-11 19:30:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:10,773 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-11-11 19:30:10,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2024-11-11 19:30:10,788 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-11 19:30:10,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2024-11-11 19:30:10,844 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 [2024-11-11 19:30:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 19:30:10,854 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 [2024-11-11 19:30:14,956 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 38 treesize of output 29 [2024-11-11 19:30:14,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:14,962 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 [2024-11-11 19:30:14,973 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-11 19:30:14,973 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 28 treesize of output 28 [2024-11-11 19:30:14,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 19:30:15,021 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 [2024-11-11 19:30:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:15,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:15,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_append_to_queue_~#p.base_47| Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1592 (Array Int Int)) (v_append_to_queue_~node~0.base_35 Int)) (or (< |v_append_to_queue_~#p.base_47| (+ |c_#StackHeapBarrier| 1)) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_47| v_ArrVal_1594) v_append_to_queue_~node~0.base_35) 0)) (= (mod (select (select (store |c_#memory_int#3| v_append_to_queue_~node~0.base_35 v_ArrVal_1593) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2024-11-11 19:30:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360341428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:15,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:30:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2024-11-11 19:30:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787977993] [2024-11-11 19:30:15,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:15,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 19:30:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:15,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 19:30:15,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=515, Unknown=2, NotChecked=46, Total=650 [2024-11-11 19:30:15,224 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 19:30:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:18,028 INFO L93 Difference]: Finished difference Result 199 states and 257 transitions. [2024-11-11 19:30:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 19:30:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-11 19:30:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:18,030 INFO L225 Difference]: With dead ends: 199 [2024-11-11 19:30:18,030 INFO L226 Difference]: Without dead ends: 172 [2024-11-11 19:30:18,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=219, Invalid=1264, Unknown=3, NotChecked=74, Total=1560 [2024-11-11 19:30:18,031 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:18,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 465 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 19:30:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-11 19:30:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2024-11-11 19:30:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 124 states have internal predecessors, (159), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 19:30:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2024-11-11 19:30:18,051 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 32 [2024-11-11 19:30:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:18,051 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2024-11-11 19:30:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 19:30:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2024-11-11 19:30:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:30:18,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:18,054 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:18,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:30:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:18,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash -649880027, now seen corresponding path program 1 times [2024-11-11 19:30:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828946121] [2024-11-11 19:30:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:30:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:18,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828946121] [2024-11-11 19:30:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828946121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912079558] [2024-11-11 19:30:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:18,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:18,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:30:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:18,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 19:30:18,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:18,947 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 [2024-11-11 19:30:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:19,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:19,279 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1848 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1849 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2024-11-11 19:30:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912079558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:19,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:30:19,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-11-11 19:30:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251242328] [2024-11-11 19:30:19,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:19,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 19:30:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 19:30:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-11 19:30:19,281 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 19:30:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:19,674 INFO L93 Difference]: Finished difference Result 200 states and 259 transitions. [2024-11-11 19:30:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:30:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-11 19:30:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:19,675 INFO L225 Difference]: With dead ends: 200 [2024-11-11 19:30:19,675 INFO L226 Difference]: Without dead ends: 157 [2024-11-11 19:30:19,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2024-11-11 19:30:19,677 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:19,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 299 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:30:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-11 19:30:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2024-11-11 19:30:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 134 states have internal predecessors, (175), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 19:30:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2024-11-11 19:30:19,695 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 33 [2024-11-11 19:30:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2024-11-11 19:30:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 19:30:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2024-11-11 19:30:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:30:19,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:19,696 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:19,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:30:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:19,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1842166586, now seen corresponding path program 1 times [2024-11-11 19:30:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221321934] [2024-11-11 19:30:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:30:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:30:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221321934] [2024-11-11 19:30:21,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221321934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:21,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137756583] [2024-11-11 19:30:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:21,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:21,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:21,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:21,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:30:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:22,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-11 19:30:22,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:22,222 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 [2024-11-11 19:30:22,272 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 17 treesize of output 9 [2024-11-11 19:30:22,318 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 [2024-11-11 19:30:22,327 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 50 treesize of output 43 [2024-11-11 19:30:22,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:22,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-11 19:30:22,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 11 [2024-11-11 19:30:22,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:30:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:22,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-11 19:30:22,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:22,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:22,557 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-11 19:30:22,559 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 24 [2024-11-11 19:30:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:30:22,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-11 19:30:22,815 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-11 19:30:22,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2024-11-11 19:30:22,822 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 38 treesize of output 29 [2024-11-11 19:30:22,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-11 19:30:22,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 19:30:22,891 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 21 treesize of output 13 [2024-11-11 19:30:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:22,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:23,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_append_to_queue_~node~0.base_49 Int) (v_ArrVal_2254 Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (|v_append_to_queue_~#p.base_67| Int)) (or (not (= (select |c_#valid| |v_append_to_queue_~#p.base_67|) 0)) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_67| v_ArrVal_2254) v_append_to_queue_~node~0.base_49) 0)) (< (mod (select (select (store |c_#memory_int#3| v_append_to_queue_~node~0.base_49 v_ArrVal_2255) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500))) is different from false [2024-11-11 19:30:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137756583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:23,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:30:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2024-11-11 19:30:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602363355] [2024-11-11 19:30:23,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 19:30:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 19:30:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=660, Unknown=1, NotChecked=52, Total=812 [2024-11-11 19:30:23,070 INFO L87 Difference]: Start difference. First operand 151 states and 201 transitions. Second operand has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:24,335 INFO L93 Difference]: Finished difference Result 190 states and 259 transitions. [2024-11-11 19:30:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 19:30:24,336 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-11 19:30:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:24,337 INFO L225 Difference]: With dead ends: 190 [2024-11-11 19:30:24,337 INFO L226 Difference]: Without dead ends: 188 [2024-11-11 19:30:24,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=1775, Unknown=1, NotChecked=88, Total=2162 [2024-11-11 19:30:24,339 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:24,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 519 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 19:30:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-11 19:30:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-11-11 19:30:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 145 states have internal predecessors, (192), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 19:30:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2024-11-11 19:30:24,355 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 220 transitions. Word has length 33 [2024-11-11 19:30:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:24,356 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 220 transitions. [2024-11-11 19:30:24,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 220 transitions. [2024-11-11 19:30:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 19:30:24,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:24,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:24,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:30:24,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 19:30:24,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:24,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 764333101, now seen corresponding path program 1 times [2024-11-11 19:30:24,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:24,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545858655] [2024-11-11 19:30:24,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:30:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:30:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545858655] [2024-11-11 19:30:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545858655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263328050] [2024-11-11 19:30:25,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:25,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:25,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:30:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:25,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-11 19:30:25,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:25,749 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 [2024-11-11 19:30:25,754 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 [2024-11-11 19:30:25,765 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_45 Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$#5.offset)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#5.base)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#5.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_45))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_45 0)) |c_#memory_$Pointer$#5.offset|) (= (select (select |c_#memory_$Pointer$#3.offset| .cse1) 12) (select .cse0 v_append_to_queue_~q.offset_45)) (= (select .cse2 v_append_to_queue_~q.offset_45) (select (select |c_#memory_$Pointer$#3.base| .cse1) 12)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_45 .cse1)))))) is different from true [2024-11-11 19:30:25,805 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-11 19:30:25,805 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 [2024-11-11 19:30:25,828 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-11 19:30:25,828 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 [2024-11-11 19:30:26,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:26,236 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 [2024-11-11 19:30:26,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:26,267 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 [2024-11-11 19:30:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:26,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:26,836 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 221 treesize of output 201 [2024-11-11 19:30:26,843 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 292 treesize of output 272 [2024-11-11 19:30:27,097 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 418 treesize of output 378 [2024-11-11 19:30:27,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:27,172 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 [2024-11-11 19:30:27,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:27,192 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 [2024-11-11 19:30:27,212 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 [2024-11-11 19:30:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263328050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:27,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 19 [2024-11-11 19:30:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94930913] [2024-11-11 19:30:27,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:27,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:30:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:30:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-11 19:30:27,393 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:30:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:28,228 INFO L93 Difference]: Finished difference Result 210 states and 284 transitions. [2024-11-11 19:30:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 19:30:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-11 19:30:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:28,230 INFO L225 Difference]: With dead ends: 210 [2024-11-11 19:30:28,230 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 19:30:28,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2024-11-11 19:30:28,231 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:28,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 539 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 321 Invalid, 0 Unknown, 116 Unchecked, 0.6s Time] [2024-11-11 19:30:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 19:30:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-11-11 19:30:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 151 states have internal predecessors, (199), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-11 19:30:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-11 19:30:28,249 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 34 [2024-11-11 19:30:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:28,249 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-11 19:30:28,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:30:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-11 19:30:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 19:30:28,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:28,250 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:28,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 19:30:28,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:28,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash -347308715, now seen corresponding path program 2 times [2024-11-11 19:30:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951313392] [2024-11-11 19:30:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 19:30:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 19:30:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951313392] [2024-11-11 19:30:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951313392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667508501] [2024-11-11 19:30:30,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:30:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:30,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:30,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:30:31,267 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:30:31,268 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:30:31,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-11 19:30:31,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:31,305 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 [2024-11-11 19:30:31,311 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 46 treesize of output 77 [2024-11-11 19:30:31,342 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 46 treesize of output 25 [2024-11-11 19:30:31,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:30:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-11 19:30:31,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-11 19:30:31,712 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 [2024-11-11 19:30:31,825 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-11 19:30:31,825 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 66 treesize of output 69 [2024-11-11 19:30:31,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 19:30:31,855 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 [2024-11-11 19:30:32,127 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 19:30:32,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 19 [2024-11-11 19:30:32,228 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 [2024-11-11 19:30:32,235 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 [2024-11-11 19:30:32,252 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 [2024-11-11 19:30:32,256 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 [2024-11-11 19:30:32,341 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 42 treesize of output 19 [2024-11-11 19:30:32,357 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-11-11 19:30:32,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 30 [2024-11-11 19:30:32,368 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 [2024-11-11 19:30:32,482 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 45 treesize of output 29 [2024-11-11 19:30:32,715 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 [2024-11-11 19:30:32,719 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 [2024-11-11 19:30:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:32,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:33,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667508501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:33,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:30:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2024-11-11 19:30:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109290510] [2024-11-11 19:30:33,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:33,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 19:30:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 19:30:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1304, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 19:30:33,236 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 34 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:30:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:41,026 INFO L93 Difference]: Finished difference Result 411 states and 543 transitions. [2024-11-11 19:30:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-11 19:30:41,026 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2024-11-11 19:30:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:41,029 INFO L225 Difference]: With dead ends: 411 [2024-11-11 19:30:41,029 INFO L226 Difference]: Without dead ends: 376 [2024-11-11 19:30:41,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=573, Invalid=6069, Unknown=0, NotChecked=0, Total=6642 [2024-11-11 19:30:41,032 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 153 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:41,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1037 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1823 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-11-11 19:30:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-11 19:30:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 254. [2024-11-11 19:30:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 222 states have (on average 1.2972972972972974) internal successors, (288), 223 states have internal predecessors, (288), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 19:30:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 336 transitions. [2024-11-11 19:30:41,063 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 336 transitions. Word has length 41 [2024-11-11 19:30:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:41,064 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 336 transitions. [2024-11-11 19:30:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:30:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 336 transitions. [2024-11-11 19:30:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 19:30:41,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:41,066 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:41,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:41,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:41,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1221381799, now seen corresponding path program 1 times [2024-11-11 19:30:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367325324] [2024-11-11 19:30:41,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:30:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:30:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:30:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367325324] [2024-11-11 19:30:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367325324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722457096] [2024-11-11 19:30:43,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:43,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:43,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:43,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:30:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:44,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-11 19:30:44,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:44,142 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 [2024-11-11 19:30:44,221 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 [2024-11-11 19:30:44,226 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 [2024-11-11 19:30:44,233 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 [2024-11-11 19:30:44,238 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 [2024-11-11 19:30:44,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:30:44,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-11 19:30:44,707 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 36 treesize of output 23 [2024-11-11 19:30:44,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-11 19:30:44,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 19:30:44,814 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-11 19:30:44,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-11 19:30:44,831 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-11 19:30:44,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-11 19:30:44,965 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 50 treesize of output 34 [2024-11-11 19:30:45,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:45,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2024-11-11 19:30:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:45,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:45,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:45,676 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 2 case distinctions, treesize of input 37 treesize of output 25 [2024-11-11 19:30:45,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:45,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 75 [2024-11-11 19:30:45,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod |c_ULTIMATE.start_main_#t~mem43#1| 4294967296) 1)))) (and (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3465 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= v_append_to_queue_~node~0.base_76 .cse0) (= (select (select (store |c_#memory_$Pointer$#3.offset| v_append_to_queue_~node~0.base_76 v_ArrVal_3465) .cse0) (+ (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)))) (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3462 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= .cse1 0) (= (select (select (store |c_#memory_$Pointer$#3.base| v_append_to_queue_~node~0.base_76 v_ArrVal_3462) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ .cse1 12)) 0)))) (or (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3462 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (= (select (select (store |c_#memory_$Pointer$#3.base| v_append_to_queue_~node~0.base_76 v_ArrVal_3462) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)) .cse2) (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3465 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= (select (select (store |c_#memory_$Pointer$#3.offset| v_append_to_queue_~node~0.base_76 v_ArrVal_3465) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ .cse3 12)) 0) (= .cse3 0)))) (or (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3465 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (= (select (select (store |c_#memory_$Pointer$#3.offset| v_append_to_queue_~node~0.base_76 v_ArrVal_3465) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)) .cse2) (forall ((v_ArrVal_3461 (Array Int Int)) (v_ArrVal_3462 (Array Int Int)) (v_ArrVal_3463 (Array Int Int)) (v_append_to_queue_~node~0.base_76 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3463) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= v_append_to_queue_~node~0.base_76 .cse4) (= (select (select (store |c_#memory_$Pointer$#3.base| v_append_to_queue_~node~0.base_76 v_ArrVal_3462) .cse4) (+ (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3461) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)))))) is different from false [2024-11-11 19:30:45,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722457096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:45,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 19:30:45,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 28 [2024-11-11 19:30:45,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134544846] [2024-11-11 19:30:45,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:45,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 19:30:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 19:30:45,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=825, Unknown=1, NotChecked=58, Total=992 [2024-11-11 19:30:45,836 INFO L87 Difference]: Start difference. First operand 254 states and 336 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:30:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:50,033 INFO L93 Difference]: Finished difference Result 563 states and 759 transitions. [2024-11-11 19:30:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 19:30:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-11 19:30:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:50,037 INFO L225 Difference]: With dead ends: 563 [2024-11-11 19:30:50,037 INFO L226 Difference]: Without dead ends: 526 [2024-11-11 19:30:50,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=300, Invalid=2355, Unknown=1, NotChecked=100, Total=2756 [2024-11-11 19:30:50,039 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 114 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:50,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1045 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 19:30:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-11 19:30:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 387. [2024-11-11 19:30:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 341 states have (on average 1.310850439882698) internal successors, (447), 342 states have internal predecessors, (447), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 19:30:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 521 transitions. [2024-11-11 19:30:50,088 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 521 transitions. Word has length 42 [2024-11-11 19:30:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:50,088 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 521 transitions. [2024-11-11 19:30:50,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:30:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 521 transitions. [2024-11-11 19:30:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 19:30:50,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:50,093 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:50,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:50,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 19:30:50,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:50,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1151774927, now seen corresponding path program 1 times [2024-11-11 19:30:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692285344] [2024-11-11 19:30:50,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:30:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:30:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:30:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:30:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692285344] [2024-11-11 19:30:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692285344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032680682] [2024-11-11 19:30:52,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:52,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:52,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:52,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 19:30:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:52,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-11 19:30:52,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:57,064 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 [2024-11-11 19:30:57,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:30:57,071 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 40 treesize of output 33 [2024-11-11 19:30:57,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 11 [2024-11-11 19:30:57,238 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 51 treesize of output 38 [2024-11-11 19:30:57,242 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 [2024-11-11 19:30:57,247 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 28 treesize of output 22 [2024-11-11 19:30:57,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:57,494 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 73 treesize of output 77 [2024-11-11 19:30:57,631 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 [2024-11-11 19:30:57,640 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 [2024-11-11 19:31:01,732 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 [2024-11-11 19:31:01,737 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 44 treesize of output 21 [2024-11-11 19:31:01,751 INFO L349 Elim1Store]: treesize reduction 41, result has 43.1 percent of original size [2024-11-11 19:31:01,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 48 [2024-11-11 19:31:01,862 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 65 treesize of output 41 [2024-11-11 19:31:02,190 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 31 treesize of output 19 [2024-11-11 19:31:02,194 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 [2024-11-11 19:31:02,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:31:02,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 42 [2024-11-11 19:31:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:31:02,416 INFO L312 TraceCheckSpWp]: Computing backward predicates...