./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 13:50:39,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:50:39,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:50:39,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:50:39,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:50:39,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:50:39,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:50:39,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:50:39,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:50:39,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:50:39,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:50:39,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:50:39,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:50:39,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:50:39,970 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:50:39,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:50:39,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:50:39,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:50:39,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:50:39,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:50:39,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:50:39,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:50:39,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:50:39,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:50:39,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:50:39,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:50:39,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:50:39,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:39,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:50:39,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:50:39,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:50:39,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:50:39,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:50:39,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:50:39,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:50:39,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:50:39,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:50:39,978 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-08 13:50:40,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:50:40,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:50:40,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:50:40,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:50:40,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:50:40,221 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-08 13:50:41,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:50:41,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:50:41,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-08 13:50:41,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f537eafd/344ec2dc74ac47e8bbf9a283d06be8eb/FLAG79dc0050e [2024-11-08 13:50:41,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f537eafd/344ec2dc74ac47e8bbf9a283d06be8eb [2024-11-08 13:50:41,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:50:41,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:50:41,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:41,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:50:41,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:50:41,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:41" (1/1) ... [2024-11-08 13:50:41,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28608384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:41, skipping insertion in model container [2024-11-08 13:50:41,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:41" (1/1) ... [2024-11-08 13:50:41,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:50:42,044 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-08 13:50:42,051 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-08 13:50:42,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:42,062 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:50:42,135 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-08 13:50:42,139 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-08 13:50:42,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:42,170 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:50:42,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42 WrapperNode [2024-11-08 13:50:42,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:42,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:42,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:50:42,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:50:42,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,213 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-11-08 13:50:42,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:42,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:50:42,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:50:42,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:50:42,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,257 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 16, 6, 6, 6, 6, 15]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 2, 3]. The 14 writes are split as follows [0, 4, 3, 3, 3, 1, 0]. [2024-11-08 13:50:42,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:50:42,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:50:42,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:50:42,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:50:42,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (1/1) ... [2024-11-08 13:50:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:42,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:42,321 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-08 13:50:42,324 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-08 13:50:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:50:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:50:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:50:42,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:50:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:50:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-11-08 13:50:42,369 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-11-08 13:50:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:50:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:50:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:50:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:50:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-11-08 13:50:42,371 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-11-08 13:50:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 13:50:42,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:50:42,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:50:42,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:50:42,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:50:42,763 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-08 13:50:42,763 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:50:42,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:50:42,777 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:50:42,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:42 BoogieIcfgContainer [2024-11-08 13:50:42,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:50:42,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:50:42,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:50:42,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:50:42,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:50:41" (1/3) ... [2024-11-08 13:50:42,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e38cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:42, skipping insertion in model container [2024-11-08 13:50:42,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:42" (2/3) ... [2024-11-08 13:50:42,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e38cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:42, skipping insertion in model container [2024-11-08 13:50:42,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:42" (3/3) ... [2024-11-08 13:50:42,786 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-11-08 13:50:42,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:50:42,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 13:50:42,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:50:42,853 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;@24b60a32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:50:42,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 13:50:42,857 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-08 13:50:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 13:50:42,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:42,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:42,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:42,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1092262807, now seen corresponding path program 1 times [2024-11-08 13:50:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138700567] [2024-11-08 13:50:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:43,019 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-08 13:50:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138700567] [2024-11-08 13:50:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138700567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:50:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864486481] [2024-11-08 13:50:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:43,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:50:43,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:43,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:50:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:50:43,050 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-08 13:50:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:43,069 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-08 13:50:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:50:43,071 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-08 13:50:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:43,076 INFO L225 Difference]: With dead ends: 76 [2024-11-08 13:50:43,077 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 13:50:43,079 INFO L431 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-08 13:50:43,081 INFO L432 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-08 13:50:43,082 INFO L433 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-08 13:50:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 13:50:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 13:50:43,107 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-08 13:50:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-08 13:50:43,109 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2024-11-08 13:50:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-08 13:50:43,110 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-08 13:50:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-08 13:50:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 13:50:43,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:43,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:50:43,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:43,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 353124844, now seen corresponding path program 1 times [2024-11-08 13:50:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708881148] [2024-11-08 13:50:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:43,298 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-08 13:50:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708881148] [2024-11-08 13:50:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708881148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:50:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872039249] [2024-11-08 13:50:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:50:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:50:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:50:43,304 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-08 13:50:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:43,374 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-08 13:50:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:50:43,374 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-08 13:50:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:43,377 INFO L225 Difference]: With dead ends: 77 [2024-11-08 13:50:43,377 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 13:50:43,377 INFO L431 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-08 13:50:43,378 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-08 13:50:43,379 INFO L433 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-08 13:50:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 13:50:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-08 13:50:43,389 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-08 13:50:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-08 13:50:43,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 9 [2024-11-08 13:50:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:43,391 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-08 13:50:43,391 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-08 13:50:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-08 13:50:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 13:50:43,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:43,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:43,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:50:43,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 380446450, now seen corresponding path program 1 times [2024-11-08 13:50:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235248540] [2024-11-08 13:50:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:43,549 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-08 13:50:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235248540] [2024-11-08 13:50:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235248540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:50:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758929330] [2024-11-08 13:50:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:43,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:50:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:50:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:50:43,551 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-08 13:50:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:43,615 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-08 13:50:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:50:43,615 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-08 13:50:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:43,616 INFO L225 Difference]: With dead ends: 69 [2024-11-08 13:50:43,616 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 13:50:43,617 INFO L431 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-08 13:50:43,617 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:43,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:50:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 13:50:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-08 13:50:43,626 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-08 13:50:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-08 13:50:43,628 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 12 [2024-11-08 13:50:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-08 13:50:43,628 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-08 13:50:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-08 13:50:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:50:43,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:43,629 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:50:43,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:43,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 707816306, now seen corresponding path program 1 times [2024-11-08 13:50:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:43,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268767863] [2024-11-08 13:50:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:50:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:43,795 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-08 13:50:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268767863] [2024-11-08 13:50:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268767863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:50:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596474600] [2024-11-08 13:50:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:50:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:50:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:50:43,801 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-08 13:50:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:43,892 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-08 13:50:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:50:43,892 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-08 13:50:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:43,893 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:50:43,893 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 13:50:43,894 INFO L431 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-08 13:50:43,894 INFO L432 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-08 13:50:43,898 INFO L433 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-08 13:50:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 13:50:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 13:50:43,902 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-08 13:50:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-08 13:50:43,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-11-08 13:50:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:43,903 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-08 13:50:43,903 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-08 13:50:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-08 13:50:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:50:43,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:43,904 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:43,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:50:43,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:43,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 707818228, now seen corresponding path program 1 times [2024-11-08 13:50:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998860466] [2024-11-08 13:50:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:50:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:45,260 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-08 13:50:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998860466] [2024-11-08 13:50:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998860466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 13:50:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832604266] [2024-11-08 13:50:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:50:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:50:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:50:45,264 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-08 13:50:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:46,080 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-11-08 13:50:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 13:50:46,080 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-08 13:50:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:46,081 INFO L225 Difference]: With dead ends: 93 [2024-11-08 13:50:46,081 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 13:50:46,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:50:46,082 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:46,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 322 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:50:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 13:50:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2024-11-08 13:50:46,088 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-08 13:50:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-08 13:50:46,088 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2024-11-08 13:50:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-08 13:50:46,089 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-08 13:50:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-08 13:50:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:50:46,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:46,090 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:46,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:50:46,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:46,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash -626681606, now seen corresponding path program 1 times [2024-11-08 13:50:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444756040] [2024-11-08 13:50:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:50:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:46,508 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-08 13:50:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444756040] [2024-11-08 13:50:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444756040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036604956] [2024-11-08 13:50:46,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:46,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:46,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:46,511 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-08 13:50:46,513 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-08 13:50:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:46,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 13:50:46,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:46,757 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-08 13:50:47,020 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-08 13:50:47,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:47,104 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-08 13:50:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036604956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:47,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:50:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2024-11-08 13:50:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272141935] [2024-11-08 13:50:47,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:47,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 13:50:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 13:50:47,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-11-08 13:50:47,109 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-08 13:50:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:47,274 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2024-11-08 13:50:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:50:47,274 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-08 13:50:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:47,275 INFO L225 Difference]: With dead ends: 93 [2024-11-08 13:50:47,276 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 13:50:47,276 INFO L431 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-08 13:50:47,277 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:47,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 199 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:50:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 13:50:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-08 13:50:47,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-08 13:50:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-08 13:50:47,287 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 21 [2024-11-08 13:50:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:47,287 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-08 13:50:47,287 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-08 13:50:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-08 13:50:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:50:47,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:47,290 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:47,304 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-08 13:50:47,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-08 13:50:47,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1015269178, now seen corresponding path program 1 times [2024-11-08 13:50:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033941648] [2024-11-08 13:50:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:50:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:48,226 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-08 13:50:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033941648] [2024-11-08 13:50:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033941648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 13:50:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009883222] [2024-11-08 13:50:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:48,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:50:48,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:50:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:50:48,230 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-08 13:50:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:48,643 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2024-11-08 13:50:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 13:50:48,644 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-08 13:50:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:48,645 INFO L225 Difference]: With dead ends: 88 [2024-11-08 13:50:48,646 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 13:50:48,646 INFO L431 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-08 13:50:48,647 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:48,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:50:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 13:50:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-08 13:50:48,656 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-08 13:50:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-08 13:50:48,656 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 21 [2024-11-08 13:50:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:48,657 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-08 13:50:48,657 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-08 13:50:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-08 13:50:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:50:48,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:48,658 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:50:48,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1374242732, now seen corresponding path program 1 times [2024-11-08 13:50:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15648333] [2024-11-08 13:50:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:50:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:48,927 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-08 13:50:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15648333] [2024-11-08 13:50:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15648333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:50:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004849473] [2024-11-08 13:50:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:50:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:50:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:50:48,929 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-08 13:50:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:49,131 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2024-11-08 13:50:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:50:49,132 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-08 13:50:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:49,133 INFO L225 Difference]: With dead ends: 100 [2024-11-08 13:50:49,133 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 13:50:49,133 INFO L431 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-08 13:50:49,134 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:49,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:50:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 13:50:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-08 13:50:49,141 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-08 13:50:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-08 13:50:49,142 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 23 [2024-11-08 13:50:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:49,142 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-08 13:50:49,142 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-08 13:50:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-08 13:50:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:50:49,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:49,143 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:49,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:50:49,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:49,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -493020186, now seen corresponding path program 1 times [2024-11-08 13:50:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571116725] [2024-11-08 13:50:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:50:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:49,781 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-08 13:50:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571116725] [2024-11-08 13:50:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571116725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 13:50:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488702184] [2024-11-08 13:50:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:50:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:50:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:50:49,783 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-08 13:50:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:50,139 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2024-11-08 13:50:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 13:50:50,139 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-08 13:50:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:50,141 INFO L225 Difference]: With dead ends: 107 [2024-11-08 13:50:50,141 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 13:50:50,142 INFO L431 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-08 13:50:50,143 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:50,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 488 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:50:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 13:50:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-08 13:50:50,154 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-08 13:50:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-11-08 13:50:50,155 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 24 [2024-11-08 13:50:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-11-08 13:50:50,155 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-08 13:50:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-11-08 13:50:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:50:50,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:50,156 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:50,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:50:50,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:50,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash -493018264, now seen corresponding path program 1 times [2024-11-08 13:50:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792517018] [2024-11-08 13:50:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:50:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:50,898 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-08 13:50:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792517018] [2024-11-08 13:50:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792517018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 13:50:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073570702] [2024-11-08 13:50:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 13:50:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 13:50:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 13:50:50,901 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-08 13:50:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:51,483 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2024-11-08 13:50:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:50:51,483 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-08 13:50:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:51,484 INFO L225 Difference]: With dead ends: 119 [2024-11-08 13:50:51,484 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 13:50:51,485 INFO L431 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-08 13:50:51,485 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:51,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 561 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:50:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 13:50:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-11-08 13:50:51,493 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-08 13:50:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2024-11-08 13:50:51,493 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 24 [2024-11-08 13:50:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2024-11-08 13:50:51,494 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-08 13:50:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2024-11-08 13:50:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 13:50:51,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:51,494 INFO L215 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-08 13:50:51,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 13:50:51,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:51,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash -854763749, now seen corresponding path program 1 times [2024-11-08 13:50:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307438510] [2024-11-08 13:50:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:50:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:50:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:52,209 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-08 13:50:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307438510] [2024-11-08 13:50:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307438510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280939887] [2024-11-08 13:50:52,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:52,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:52,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:52,212 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-08 13:50:52,213 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-08 13:50:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:52,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 13:50:52,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:52,446 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-08 13:50:52,459 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-08 13:50:52,498 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-08 13:50:52,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 13:50:52,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 13:50:52,646 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-08 13:50:52,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:52,886 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-08 13:50:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280939887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:52,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2024-11-08 13:50:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107239660] [2024-11-08 13:50:52,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:52,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:50:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:50:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:50:52,887 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:50:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:53,891 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-11-08 13:50:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 13:50:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-08 13:50:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:53,892 INFO L225 Difference]: With dead ends: 162 [2024-11-08 13:50:53,892 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 13:50:53,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-08 13:50:53,893 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:53,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 388 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 13:50:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 13:50:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-11-08 13:50:53,902 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-08 13:50:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-11-08 13:50:53,903 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 30 [2024-11-08 13:50:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-11-08 13:50:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:50:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-11-08 13:50:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 13:50:53,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:53,904 INFO L215 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-08 13:50:53,919 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-08 13:50:54,108 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-08 13:50:54,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:54,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash 778676608, now seen corresponding path program 1 times [2024-11-08 13:50:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839585663] [2024-11-08 13:50:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:50:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:50:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:55,746 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-08 13:50:55,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839585663] [2024-11-08 13:50:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839585663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359283260] [2024-11-08 13:50:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:55,749 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-08 13:50:55,752 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-08 13:50:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:55,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-08 13:50:56,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:56,006 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-08 13:50:56,071 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 51 treesize of output 21 [2024-11-08 13:50:56,094 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-08 13:50:56,099 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-08 13:50:56,108 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 52 treesize of output 31 [2024-11-08 13:50:56,128 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-08 13:50:56,129 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-08 13:50:56,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:50:56,222 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-08 13:50:56,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:50:56,262 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-11-08 13:50:56,263 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-08 13:50:56,273 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-08 13:50:56,273 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-08 13:50:56,324 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-08 13:50:56,331 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-08 13:50:56,335 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-08 13:51:00,423 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-08 13:51:00,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:00,429 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-08 13:51:00,440 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:51:00,440 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-08 13:51:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 13:51:00,468 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-08 13:51:00,490 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-08 13:51:00,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:00,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_append_to_queue_~node~0.base_35 Int) (|v_append_to_queue_~#p.base_43| Int) (v_ArrVal_1603 Int)) (or (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_43| v_ArrVal_1603) v_append_to_queue_~node~0.base_35) 0)) (= (mod (select (select (store |c_#memory_int#1| v_append_to_queue_~node~0.base_35 v_ArrVal_1602) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1601) |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_1600) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1) (< |v_append_to_queue_~#p.base_43| (+ |c_#StackHeapBarrier| 1)))) is different from false [2024-11-08 13:51:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359283260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:00,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2024-11-08 13:51:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961618172] [2024-11-08 13:51:00,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:00,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 13:51:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 13:51:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=355, Unknown=2, NotChecked=38, Total=462 [2024-11-08 13:51:00,618 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:51:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:03,270 INFO L93 Difference]: Finished difference Result 199 states and 257 transitions. [2024-11-08 13:51:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 13:51:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-08 13:51:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:03,273 INFO L225 Difference]: With dead ends: 199 [2024-11-08 13:51:03,273 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 13:51:03,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=183, Invalid=1008, Unknown=3, NotChecked=66, Total=1260 [2024-11-08 13:51:03,274 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:03,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 377 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 13:51:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 13:51:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2024-11-08 13:51:03,291 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-08 13:51:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2024-11-08 13:51:03,292 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 32 [2024-11-08 13:51:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:03,292 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2024-11-08 13:51:03,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:51:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2024-11-08 13:51:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:51:03,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:03,293 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:03,307 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-08 13:51:03,497 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-08 13:51:03,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash -649880027, now seen corresponding path program 1 times [2024-11-08 13:51:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124635891] [2024-11-08 13:51:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:51:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:51:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:03,816 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-08 13:51:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124635891] [2024-11-08 13:51:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124635891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661898404] [2024-11-08 13:51:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:03,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:03,818 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-08 13:51:03,820 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-08 13:51:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 13:51:04,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:04,041 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-08 13:51:04,256 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-08 13:51:04,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:04,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661898404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:04,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-11-08 13:51:04,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242876099] [2024-11-08 13:51:04,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:51:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:04,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:51:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=80, Unknown=4, NotChecked=0, Total=110 [2024-11-08 13:51:04,358 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-08 13:51:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:04,679 INFO L93 Difference]: Finished difference Result 200 states and 259 transitions. [2024-11-08 13:51:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:51:04,680 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-08 13:51:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:04,681 INFO L225 Difference]: With dead ends: 200 [2024-11-08 13:51:04,681 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 13:51:04,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=156, Unknown=4, NotChecked=0, Total=210 [2024-11-08 13:51:04,682 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:04,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 190 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:51:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 13:51:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2024-11-08 13:51:04,699 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-08 13:51:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2024-11-08 13:51:04,700 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 33 [2024-11-08 13:51:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2024-11-08 13:51:04,701 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-08 13:51:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2024-11-08 13:51:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:51:04,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:04,702 INFO L215 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-08 13:51:04,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:04,903 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-08 13:51:04,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:04,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1842166586, now seen corresponding path program 1 times [2024-11-08 13:51:04,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260823265] [2024-11-08 13:51:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:51:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:51:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:06,366 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-08 13:51:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260823265] [2024-11-08 13:51:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260823265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494728052] [2024-11-08 13:51:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:06,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:06,368 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-08 13:51:06,369 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-08 13:51:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:06,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-08 13:51:06,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:06,753 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-08 13:51:06,793 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-08 13:51:06,858 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-08 13:51:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:06,868 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-08 13:51:06,878 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-08 13:51:06,885 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-08 13:51:06,888 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-08 13:51:06,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:06,975 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-08 13:51:07,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:07,038 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-11-08 13:51:07,038 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-08 13:51:07,048 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-08 13:51:07,048 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-08 13:51:07,102 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 32 treesize of output 20 [2024-11-08 13:51:07,106 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-08 13:51:07,109 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 9 treesize of output 5 [2024-11-08 13:51:07,198 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-08 13:51:07,216 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-08 13:51:07,216 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-08 13:51:07,220 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-08 13:51:07,230 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-08 13:51:07,269 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-08 13:51:07,300 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-08 13:51:07,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:07,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_append_to_queue_~node~0.base_49 Int) (v_ArrVal_2259 (Array Int Int)) (|v_append_to_queue_~#p.base_62| Int) (v_ArrVal_2258 Int) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ v_append_to_queue_~node~0.base_49 1)) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_62| v_ArrVal_2258) v_append_to_queue_~node~0.base_49) 0)) (< (mod (select (select (store |c_#memory_int#1| v_append_to_queue_~node~0.base_49 v_ArrVal_2261) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2260) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2259) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (not (= 0 (select |c_#valid| |v_append_to_queue_~#p.base_62|))))) is different from false [2024-11-08 13:51:07,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494728052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:07,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:07,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-11-08 13:51:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448403322] [2024-11-08 13:51:07,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:07,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:51:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:51:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=613, Unknown=1, NotChecked=50, Total=756 [2024-11-08 13:51:07,442 INFO L87 Difference]: Start difference. First operand 151 states and 201 transitions. Second operand has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 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-08 13:51:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:08,721 INFO L93 Difference]: Finished difference Result 190 states and 259 transitions. [2024-11-08 13:51:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 13:51:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 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-08 13:51:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:08,729 INFO L225 Difference]: With dead ends: 190 [2024-11-08 13:51:08,729 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 13:51:08,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1615, Unknown=1, NotChecked=84, Total=1980 [2024-11-08 13:51:08,730 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 79 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:08,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 448 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:51:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 13:51:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-11-08 13:51:08,741 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-08 13:51:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2024-11-08 13:51:08,742 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 220 transitions. Word has length 33 [2024-11-08 13:51:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 220 transitions. [2024-11-08 13:51:08,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 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-08 13:51:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 220 transitions. [2024-11-08 13:51:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:51:08,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:08,743 INFO L215 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-08 13:51:08,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:08,943 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-08 13:51:08,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:08,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 764333101, now seen corresponding path program 1 times [2024-11-08 13:51:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405964178] [2024-11-08 13:51:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:51:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:09,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 13:51:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:09,551 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-08 13:51:09,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:09,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405964178] [2024-11-08 13:51:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405964178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127363043] [2024-11-08 13:51:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:09,553 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-08 13:51:09,554 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-08 13:51:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:09,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 13:51:09,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:09,819 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-08 13:51:09,823 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-08 13:51:09,829 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-08 13:51:09,839 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_43 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_43))) (and (= (select .cse0 v_append_to_queue_~q.offset_43) (select (select |c_#memory_$Pointer$#1.offset| .cse1) 12)) (= (store |c_old(#memory_$Pointer$#5.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_43 .cse1)) |c_#memory_$Pointer$#5.base|) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_43 0))) (= (select .cse2 v_append_to_queue_~q.offset_43) (select (select |c_#memory_$Pointer$#1.base| .cse1) 12))))) is different from true [2024-11-08 13:51:09,870 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-08 13:51:09,870 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-08 13:51:09,887 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-08 13:51:09,887 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-08 13:51:10,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:10,267 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-08 13:51:10,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:10,294 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-08 13:51:10,667 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-08 13:51:10,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:10,885 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 465 treesize of output 425 [2024-11-08 13:51:10,889 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 176 treesize of output 172 [2024-11-08 13:51:10,894 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 316 treesize of output 296 [2024-11-08 13:51:11,115 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-08 13:51:11,120 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-08 13:51:11,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:11,166 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-08 13:51:11,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-08 13:51:11,181 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-08 13:51:11,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:11,254 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-08 13:51:11,371 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-08 13:51:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127363043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:11,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-11-08 13:51:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074325167] [2024-11-08 13:51:11,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:11,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 13:51:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 13:51:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2024-11-08 13:51:11,373 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:51:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:12,037 INFO L93 Difference]: Finished difference Result 210 states and 284 transitions. [2024-11-08 13:51:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 13:51:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-08 13:51:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:12,041 INFO L225 Difference]: With dead ends: 210 [2024-11-08 13:51:12,042 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 13:51:12,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-08 13:51:12,042 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 30 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:12,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 624 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 315 Invalid, 0 Unknown, 116 Unchecked, 0.4s Time] [2024-11-08 13:51:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 13:51:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-11-08 13:51:12,053 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-08 13:51:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-08 13:51:12,054 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 34 [2024-11-08 13:51:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-08 13:51:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:51:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-08 13:51:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 13:51:12,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:12,055 INFO L215 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-08 13:51:12,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 13:51:12,256 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-08 13:51:12,256 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -347308715, now seen corresponding path program 2 times [2024-11-08 13:51:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49486224] [2024-11-08 13:51:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:51:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 13:51:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 13:51:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49486224] [2024-11-08 13:51:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49486224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565307103] [2024-11-08 13:51:14,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:51:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:14,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:14,337 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-08 13:51:14,338 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-08 13:51:14,635 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:51:14,635 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:51:14,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-08 13:51:14,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:14,650 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-08 13:51:14,654 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-08 13:51:14,689 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-08 13:51:14,888 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-08 13:51:14,894 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-08 13:51:14,898 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-08 13:51:14,900 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-08 13:51:15,044 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-08 13:51:15,045 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-08 13:51:15,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:15,055 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-08 13:51:15,072 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-08 13:51:15,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:15,103 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 52 treesize of output 28 [2024-11-08 13:51:15,244 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:51:15,244 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-08 13:51:15,289 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-08 13:51:15,300 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-08 13:51:15,314 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-08 13:51:15,398 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-08 13:51:15,407 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-11-08 13:51:15,408 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-08 13:51:15,413 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-08 13:51:15,476 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-08 13:51:15,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 19 treesize of output 11 [2024-11-08 13:51:15,638 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-08 13:51:15,696 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-08 13:51:15,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565307103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:16,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 35 [2024-11-08 13:51:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555815603] [2024-11-08 13:51:16,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:16,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 13:51:16,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 13:51:16,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 13:51:16,057 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 35 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:20,815 INFO L93 Difference]: Finished difference Result 476 states and 610 transitions. [2024-11-08 13:51:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 13:51:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2024-11-08 13:51:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:20,817 INFO L225 Difference]: With dead ends: 476 [2024-11-08 13:51:20,817 INFO L226 Difference]: Without dead ends: 441 [2024-11-08 13:51:20,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=520, Invalid=5486, Unknown=0, NotChecked=0, Total=6006 [2024-11-08 13:51:20,821 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 176 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:20,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1163 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 13:51:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-08 13:51:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 264. [2024-11-08 13:51:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 231 states have (on average 1.29004329004329) internal successors, (298), 232 states have internal predecessors, (298), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 13:51:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 346 transitions. [2024-11-08 13:51:20,851 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 346 transitions. Word has length 41 [2024-11-08 13:51:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:20,851 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 346 transitions. [2024-11-08 13:51:20,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 346 transitions. [2024-11-08 13:51:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:51:20,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:20,853 INFO L215 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-08 13:51:20,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 13:51:21,053 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-08 13:51:21,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1221381799, now seen corresponding path program 1 times [2024-11-08 13:51:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543813012] [2024-11-08 13:51:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:51:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:51:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 13:51:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:22,766 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-08 13:51:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543813012] [2024-11-08 13:51:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543813012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401998474] [2024-11-08 13:51:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:22,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:22,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:22,768 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-08 13:51:22,769 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-08 13:51:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:23,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-08 13:51:23,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:23,054 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-08 13:51:23,072 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:51:23,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 9 [2024-11-08 13:51:23,165 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-08 13:51:23,171 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-08 13:51:23,176 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-08 13:51:23,181 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-08 13:51:23,258 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-08 13:51:23,263 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-08 13:51:23,295 INFO L349 Elim1Store]: treesize reduction 49, result has 48.4 percent of original size [2024-11-08 13:51:23,295 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 4 case distinctions, treesize of input 55 treesize of output 77 [2024-11-08 13:51:23,451 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-08 13:51:23,451 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 57 treesize of output 68 [2024-11-08 13:51:23,539 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:51:23,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-08 13:51:23,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:23,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:23,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-08 13:51:23,607 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 24 [2024-11-08 13:51:23,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-08 13:51:23,614 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-08 13:51:23,620 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-08 13:51:27,787 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 48 treesize of output 37 [2024-11-08 13:51:27,790 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-08 13:51:27,800 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:51:27,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2024-11-08 13:51:27,805 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-08 13:51:27,811 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-08 13:51:27,837 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-08 13:51:27,900 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-08 13:51:27,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401998474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:28,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2024-11-08 13:51:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907244733] [2024-11-08 13:51:28,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 13:51:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 13:51:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2024-11-08 13:51:28,185 INFO L87 Difference]: Start difference. First operand 264 states and 346 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:29,396 INFO L93 Difference]: Finished difference Result 597 states and 791 transitions. [2024-11-08 13:51:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 13:51:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-11-08 13:51:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:29,399 INFO L225 Difference]: With dead ends: 597 [2024-11-08 13:51:29,399 INFO L226 Difference]: Without dead ends: 540 [2024-11-08 13:51:29,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=126, Invalid=803, Unknown=1, NotChecked=0, Total=930 [2024-11-08 13:51:29,400 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 101 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:29,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 436 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 13:51:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-08 13:51:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 420. [2024-11-08 13:51:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 371 states have (on average 1.2991913746630728) internal successors, (482), 372 states have internal predecessors, (482), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 13:51:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 558 transitions. [2024-11-08 13:51:29,437 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 558 transitions. Word has length 42 [2024-11-08 13:51:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:29,438 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 558 transitions. [2024-11-08 13:51:29,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 558 transitions. [2024-11-08 13:51:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:51:29,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:29,439 INFO L215 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-08 13:51:29,453 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-08 13:51:29,639 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-08 13:51:29,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:29,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1099551513, now seen corresponding path program 1 times [2024-11-08 13:51:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:29,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113599340] [2024-11-08 13:51:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:29,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:51:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:51:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 13:51:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:51:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113599340] [2024-11-08 13:51:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113599340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 13:51:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656483335] [2024-11-08 13:51:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:51:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:51:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:51:30,560 INFO L87 Difference]: Start difference. First operand 420 states and 558 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:51:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:31,098 INFO L93 Difference]: Finished difference Result 524 states and 684 transitions. [2024-11-08 13:51:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:51:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2024-11-08 13:51:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:31,102 INFO L225 Difference]: With dead ends: 524 [2024-11-08 13:51:31,102 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 13:51:31,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-08 13:51:31,102 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:31,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 418 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:51:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 13:51:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 420. [2024-11-08 13:51:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 371 states have (on average 1.2884097035040432) internal successors, (478), 372 states have internal predecessors, (478), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 13:51:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 554 transitions. [2024-11-08 13:51:31,133 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 554 transitions. Word has length 42 [2024-11-08 13:51:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 554 transitions. [2024-11-08 13:51:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:51:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 554 transitions. [2024-11-08 13:51:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:51:31,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:31,134 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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] [2024-11-08 13:51:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 13:51:31,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1686357527, now seen corresponding path program 1 times [2024-11-08 13:51:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086858594] [2024-11-08 13:51:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 13:51:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:51:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 13:51:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086858594] [2024-11-08 13:51:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086858594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352283623] [2024-11-08 13:51:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:32,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:32,969 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-08 13:51:32,971 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-08 13:51:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:33,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 13:51:33,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:33,298 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 29 treesize of output 1 [2024-11-08 13:51:33,301 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 32 treesize of output 20 [2024-11-08 13:51:33,339 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-08 13:51:33,374 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-08 13:51:33,375 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-08 13:51:33,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2024-11-08 13:51:33,393 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:51:33,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2024-11-08 13:51:33,474 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:51:33,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-08 13:51:33,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:33,540 INFO L349 Elim1Store]: treesize reduction 47, result has 44.0 percent of original size [2024-11-08 13:51:33,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2024-11-08 13:51:33,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:33,568 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-08 13:51:33,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-08 13:51:33,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-08 13:51:33,610 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-08 13:51:33,645 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-08 13:51:33,651 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-08 13:51:33,656 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-08 13:51:33,660 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-08 13:51:33,752 INFO L349 Elim1Store]: treesize reduction 13, result has 68.3 percent of original size [2024-11-08 13:51:33,753 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 53 treesize of output 66 [2024-11-08 13:51:33,757 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 77 treesize of output 42 [2024-11-08 13:51:33,760 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 32 treesize of output 19 [2024-11-08 13:51:33,770 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-08 13:51:33,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 50 treesize of output 30 [2024-11-08 13:51:33,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 13:51:33,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:51:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:33,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352283623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:34,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2024-11-08 13:51:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099324542] [2024-11-08 13:51:34,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 13:51:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 13:51:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2024-11-08 13:51:34,274 INFO L87 Difference]: Start difference. First operand 420 states and 554 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 23 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:37,672 INFO L93 Difference]: Finished difference Result 683 states and 887 transitions. [2024-11-08 13:51:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-08 13:51:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 23 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-11-08 13:51:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:37,675 INFO L225 Difference]: With dead ends: 683 [2024-11-08 13:51:37,675 INFO L226 Difference]: Without dead ends: 628 [2024-11-08 13:51:37,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=2848, Unknown=0, NotChecked=0, Total=3192 [2024-11-08 13:51:37,676 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 89 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:37,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 752 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 13:51:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-08 13:51:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 440. [2024-11-08 13:51:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 389 states have (on average 1.2853470437017995) internal successors, (500), 390 states have internal predecessors, (500), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 13:51:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 580 transitions. [2024-11-08 13:51:37,720 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 580 transitions. Word has length 42 [2024-11-08 13:51:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:37,721 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 580 transitions. [2024-11-08 13:51:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 23 states have internal predecessors, (65), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:51:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 580 transitions. [2024-11-08 13:51:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:51:37,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:37,722 INFO L215 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-08 13:51:37,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 13:51:37,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:37,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:37,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1151774927, now seen corresponding path program 2 times [2024-11-08 13:51:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:37,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530092766] [2024-11-08 13:51:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:39,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 13:51:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:51:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 13:51:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:39,508 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-08 13:51:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530092766] [2024-11-08 13:51:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530092766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256640745] [2024-11-08 13:51:39,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:51:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:39,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:39,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:51:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 13:51:39,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:51:39,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:51:39,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-08 13:51:39,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:40,502 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 52 treesize of output 31 [2024-11-08 13:51:40,511 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-08 13:51:40,513 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-08 13:51:40,691 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-11-08 13:51:40,692 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 3 case distinctions, treesize of input 52 treesize of output 45 [2024-11-08 13:51:40,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:40,701 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 50 [2024-11-08 13:51:40,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:40,953 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 62 treesize of output 72 [2024-11-08 13:51:41,123 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-08 13:51:41,134 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-08 13:51:41,145 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-08 13:51:41,227 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-08 13:51:41,241 INFO L349 Elim1Store]: treesize reduction 41, result has 43.1 percent of original size [2024-11-08 13:51:41,241 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 78 treesize of output 37 [2024-11-08 13:51:41,252 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-08 13:51:41,362 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 75 treesize of output 47 [2024-11-08 13:51:41,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-08 13:51:41,952 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-08 13:51:42,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:51:42,098 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 60 treesize of output 40 [2024-11-08 13:51:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:42,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:42,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256640745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:42,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2024-11-08 13:51:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222471566] [2024-11-08 13:51:42,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:42,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 13:51:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:42,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 13:51:42,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 13:51:42,781 INFO L87 Difference]: Start difference. First operand 440 states and 580 transitions. Second operand has 36 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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-08 13:51:59,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:52:00,926 INFO L93 Difference]: Finished difference Result 1118 states and 1465 transitions. [2024-11-08 13:52:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-08 13:52:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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 42 [2024-11-08 13:52:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:52:00,930 INFO L225 Difference]: With dead ends: 1118 [2024-11-08 13:52:00,931 INFO L226 Difference]: Without dead ends: 1116 [2024-11-08 13:52:00,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5126 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1207, Invalid=17425, Unknown=0, NotChecked=0, Total=18632 [2024-11-08 13:52:00,935 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4805 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:52:00,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2353 Invalid, 4839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4805 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2024-11-08 13:52:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-08 13:52:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 653. [2024-11-08 13:52:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 585 states have (on average 1.288888888888889) internal successors, (754), 586 states have internal predecessors, (754), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 13:52:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 862 transitions. [2024-11-08 13:52:01,003 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 862 transitions. Word has length 42 [2024-11-08 13:52:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:52:01,004 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 862 transitions. [2024-11-08 13:52:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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-08 13:52:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 862 transitions. [2024-11-08 13:52:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 13:52:01,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:52:01,005 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:52:01,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 13:52:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:52:01,206 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:52:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:52:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1205244404, now seen corresponding path program 2 times [2024-11-08 13:52:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:52:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507091918] [2024-11-08 13:52:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:52:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:52:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat