./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:18:02,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:18:02,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:18:02,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:18:02,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:18:02,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:18:02,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:18:02,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:18:02,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:18:02,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:18:02,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:18:02,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:18:02,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:18:02,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:18:02,460 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:18:02,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:18:02,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:18:02,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:18:02,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:18:02,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:18:02,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:18:02,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:18:02,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:18:02,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:18:02,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:18:02,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:18:02,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:18:02,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:18:02,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:18:02,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:18:02,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:18:02,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:18:02,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:02,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:18:02,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:18:02,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:18:02,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:18:02,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:18:02,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:18:02,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:18:02,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:18:02,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:18:02,473 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-10-12 18:18:02,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:18:02,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:18:02,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:18:02,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:18:02,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:18:02,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-10-12 18:18:04,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:18:04,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:18:04,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-10-12 18:18:04,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f1d702c/81e3bf5248e74bf0af02c5e59b14d775/FLAGaa8483a8e [2024-10-12 18:18:04,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f1d702c/81e3bf5248e74bf0af02c5e59b14d775 [2024-10-12 18:18:04,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:18:04,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:18:04,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:04,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:18:04,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:18:04,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:04" (1/1) ... [2024-10-12 18:18:04,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510cacce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:04, skipping insertion in model container [2024-10-12 18:18:04,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:04" (1/1) ... [2024-10-12 18:18:04,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:18:05,177 WARN L248 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-10-12 18:18:05,189 WARN L248 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-10-12 18:18:05,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:05,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:18:05,256 WARN L248 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-10-12 18:18:05,258 WARN L248 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-10-12 18:18:05,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:05,308 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:18:05,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05 WrapperNode [2024-10-12 18:18:05,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:05,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:05,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:18:05,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:18:05,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,384 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-10-12 18:18:05,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:05,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:18:05,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:18:05,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:18:05,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,422 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [6, 2, 6, 16, 6, 15, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [0, 2, 2, 0, 0, 3, 0]. The 14 writes are split as follows [3, 0, 1, 4, 3, 0, 3]. [2024-10-12 18:18:05,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:18:05,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:18:05,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:18:05,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:18:05,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (1/1) ... [2024-10-12 18:18:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:05,527 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-10-12 18:18:05,532 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-10-12 18:18:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 18:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 18:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 18:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 18:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 18:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-10-12 18:18:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-10-12 18:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 18:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 18:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-10-12 18:18:05,587 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 18:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 18:18:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 18:18:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 18:18:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:18:05,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:18:05,775 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:18:05,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:18:06,180 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-12 18:18:06,180 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:18:06,257 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:18:06,259 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 18:18:06,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:06 BoogieIcfgContainer [2024-10-12 18:18:06,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:18:06,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:18:06,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:18:06,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:18:06,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:18:04" (1/3) ... [2024-10-12 18:18:06,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a781a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:06, skipping insertion in model container [2024-10-12 18:18:06,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:05" (2/3) ... [2024-10-12 18:18:06,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a781a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:06, skipping insertion in model container [2024-10-12 18:18:06,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:06" (3/3) ... [2024-10-12 18:18:06,270 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-10-12 18:18:06,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:18:06,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 18:18:06,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:18:06,356 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;@2eadfe35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:18:06,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 18:18:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 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-10-12 18:18:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:18:06,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:06,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:06,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:06,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -949461624, now seen corresponding path program 1 times [2024-10-12 18:18:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:06,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75782916] [2024-10-12 18:18:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75782916] [2024-10-12 18:18:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75782916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:06,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:18:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431419104] [2024-10-12 18:18:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:18:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:18:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:06,606 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:06,680 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2024-10-12 18:18:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:18:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 18:18:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:06,690 INFO L225 Difference]: With dead ends: 59 [2024-10-12 18:18:06,691 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:18:06,695 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-10-12 18:18:06,700 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:06,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:18:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 18:18:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:18:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-10-12 18:18:06,748 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 7 [2024-10-12 18:18:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:06,749 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-10-12 18:18:06,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-10-12 18:18:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 18:18:06,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:06,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:18:06,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:06,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 484994221, now seen corresponding path program 1 times [2024-10-12 18:18:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380151792] [2024-10-12 18:18:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380151792] [2024-10-12 18:18:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380151792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:18:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700310279] [2024-10-12 18:18:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:07,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:18:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:18:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:18:07,042 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:07,180 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2024-10-12 18:18:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:18:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-12 18:18:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:07,183 INFO L225 Difference]: With dead ends: 65 [2024-10-12 18:18:07,183 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 18:18:07,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-12 18:18:07,188 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:07,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 102 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 18:18:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-10-12 18:18:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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-10-12 18:18:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-10-12 18:18:07,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 8 [2024-10-12 18:18:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:07,207 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-10-12 18:18:07,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-10-12 18:18:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:18:07,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:07,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:18:07,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:07,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2056469504, now seen corresponding path program 1 times [2024-10-12 18:18:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198274333] [2024-10-12 18:18:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198274333] [2024-10-12 18:18:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198274333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:07,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:18:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221940073] [2024-10-12 18:18:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:07,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:18:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:18:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:18:07,378 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:07,498 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-10-12 18:18:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:18:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:18:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:07,499 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:18:07,500 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 18:18:07,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-12 18:18:07,501 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:07,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 18:18:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-10-12 18:18:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-10-12 18:18:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-10-12 18:18:07,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 10 [2024-10-12 18:18:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:07,511 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-10-12 18:18:07,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-10-12 18:18:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:18:07,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:07,513 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:18:07,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -632406958, now seen corresponding path program 1 times [2024-10-12 18:18:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42187868] [2024-10-12 18:18:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42187868] [2024-10-12 18:18:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42187868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:18:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184497694] [2024-10-12 18:18:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:18:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:07,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:18:07,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:18:07,775 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:07,896 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-12 18:18:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:18:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 18:18:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:07,898 INFO L225 Difference]: With dead ends: 42 [2024-10-12 18:18:07,901 INFO L226 Difference]: Without dead ends: 40 [2024-10-12 18:18:07,902 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-10-12 18:18:07,903 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:07,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-12 18:18:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-12 18:18:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 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-10-12 18:18:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-10-12 18:18:07,915 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 17 [2024-10-12 18:18:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:07,915 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-10-12 18:18:07,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-10-12 18:18:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:18:07,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:07,916 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:07,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:18:07,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash -632405036, now seen corresponding path program 1 times [2024-10-12 18:18:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142916890] [2024-10-12 18:18:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:09,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:09,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142916890] [2024-10-12 18:18:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142916890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:09,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 18:18:09,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097901946] [2024-10-12 18:18:09,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:09,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:18:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:09,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:18:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:18:09,487 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:10,474 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2024-10-12 18:18:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:18:10,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 18:18:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:10,476 INFO L225 Difference]: With dead ends: 79 [2024-10-12 18:18:10,476 INFO L226 Difference]: Without dead ends: 59 [2024-10-12 18:18:10,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:18:10,477 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:10,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 208 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 18:18:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-12 18:18:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2024-10-12 18:18:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 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-10-12 18:18:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-12 18:18:10,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 17 [2024-10-12 18:18:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:10,486 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-12 18:18:10,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-12 18:18:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:18:10,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:10,487 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:10,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:18:10,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 231415546, now seen corresponding path program 1 times [2024-10-12 18:18:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906896598] [2024-10-12 18:18:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906896598] [2024-10-12 18:18:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906896598] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299800438] [2024-10-12 18:18:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:10,977 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-10-12 18:18:10,979 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-10-12 18:18:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:11,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 18:18:11,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:11,259 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-10-12 18:18:11,383 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-10-12 18:18:11,393 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-10-12 18:18:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:11,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:11,546 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |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$#2.offset| |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-10-12 18:18:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299800438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:11,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-12 18:18:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586788672] [2024-10-12 18:18:11,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:18:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:18:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-10-12 18:18:11,554 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:11,793 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2024-10-12 18:18:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:18:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-12 18:18:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:11,795 INFO L225 Difference]: With dead ends: 79 [2024-10-12 18:18:11,795 INFO L226 Difference]: Without dead ends: 59 [2024-10-12 18:18:11,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2024-10-12 18:18:11,796 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:11,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 179 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-12 18:18:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-12 18:18:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 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-10-12 18:18:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-10-12 18:18:11,814 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 18 [2024-10-12 18:18:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-10-12 18:18:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-10-12 18:18:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:18:11,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:11,816 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:11,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:12,016 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-10-12 18:18:12,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 179772406, now seen corresponding path program 1 times [2024-10-12 18:18:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332182925] [2024-10-12 18:18:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332182925] [2024-10-12 18:18:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332182925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 18:18:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615983527] [2024-10-12 18:18:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:12,934 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:13,480 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2024-10-12 18:18:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:18:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-12 18:18:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:13,482 INFO L225 Difference]: With dead ends: 76 [2024-10-12 18:18:13,484 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 18:18:13,484 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-10-12 18:18:13,485 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:13,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 258 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:18:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 18:18:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-12 18:18:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 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-10-12 18:18:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-10-12 18:18:13,503 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 18 [2024-10-12 18:18:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-10-12 18:18:13,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:18:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-10-12 18:18:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:18:13,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:13,505 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:13,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:18:13,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2137178523, now seen corresponding path program 1 times [2024-10-12 18:18:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333608714] [2024-10-12 18:18:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:13,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333608714] [2024-10-12 18:18:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333608714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981755704] [2024-10-12 18:18:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:13,769 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:18:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:14,048 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-10-12 18:18:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:18:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 19 [2024-10-12 18:18:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:14,049 INFO L225 Difference]: With dead ends: 85 [2024-10-12 18:18:14,049 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 18:18:14,050 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-10-12 18:18:14,051 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:14,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 180 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 18:18:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-12 18:18:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 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-10-12 18:18:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-10-12 18:18:14,060 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 19 [2024-10-12 18:18:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:14,060 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-10-12 18:18:14,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:18:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-10-12 18:18:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:14,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:14,061 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-10-12 18:18:14,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:18:14,062 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:14,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -934287349, now seen corresponding path program 1 times [2024-10-12 18:18:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735737045] [2024-10-12 18:18:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:14,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735737045] [2024-10-12 18:18:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735737045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 18:18:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490031403] [2024-10-12 18:18:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:14,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:18:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:18:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:18:14,789 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 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-10-12 18:18:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:15,288 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2024-10-12 18:18:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:18:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 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-10-12 18:18:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:15,290 INFO L225 Difference]: With dead ends: 93 [2024-10-12 18:18:15,290 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 18:18:15,291 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-10-12 18:18:15,291 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:15,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 360 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:18:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 18:18:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2024-10-12 18:18:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 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-10-12 18:18:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2024-10-12 18:18:15,305 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 20 [2024-10-12 18:18:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:15,305 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2024-10-12 18:18:15,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 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-10-12 18:18:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2024-10-12 18:18:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:15,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:15,306 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-10-12 18:18:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:18:15,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash -934285427, now seen corresponding path program 1 times [2024-10-12 18:18:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257904859] [2024-10-12 18:18:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:16,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257904859] [2024-10-12 18:18:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257904859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:16,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:16,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 18:18:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764252731] [2024-10-12 18:18:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:16,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:16,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:16,244 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 11 states, 9 states have (on average 2.0) 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-10-12 18:18:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:17,300 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-10-12 18:18:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:18:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) 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-10-12 18:18:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:17,302 INFO L225 Difference]: With dead ends: 103 [2024-10-12 18:18:17,305 INFO L226 Difference]: Without dead ends: 93 [2024-10-12 18:18:17,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-12 18:18:17,306 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:17,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 328 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:18:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-12 18:18:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2024-10-12 18:18:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.34375) internal successors, (86), 65 states have internal predecessors, (86), 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-10-12 18:18:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-10-12 18:18:17,327 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 20 [2024-10-12 18:18:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:17,328 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-10-12 18:18:17,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) 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-10-12 18:18:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2024-10-12 18:18:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:18:17,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:17,333 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] [2024-10-12 18:18:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:18:17,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:17,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2092316765, now seen corresponding path program 1 times [2024-10-12 18:18:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878062790] [2024-10-12 18:18:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 18:18:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878062790] [2024-10-12 18:18:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878062790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480221687] [2024-10-12 18:18:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:18,253 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-10-12 18:18:18,258 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-10-12 18:18:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-12 18:18:18,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:18,580 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-10-12 18:18:18,590 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-10-12 18:18:18,598 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-10-12 18:18:18,648 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-10-12 18:18:18,657 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-10-12 18:18:18,711 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-10-12 18:18:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:18,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480221687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:19,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-10-12 18:18:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818914958] [2024-10-12 18:18:19,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:19,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:18:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:18:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:18:19,142 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:20,466 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2024-10-12 18:18:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:18:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2024-10-12 18:18:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:20,468 INFO L225 Difference]: With dead ends: 139 [2024-10-12 18:18:20,469 INFO L226 Difference]: Without dead ends: 119 [2024-10-12 18:18:20,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:18:20,470 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 48 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:20,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 338 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 18:18:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-12 18:18:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2024-10-12 18:18:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 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-10-12 18:18:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2024-10-12 18:18:20,485 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 25 [2024-10-12 18:18:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2024-10-12 18:18:20,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2024-10-12 18:18:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:18:20,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:20,487 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:20,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:18:20,688 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-10-12 18:18:20,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash -186555297, now seen corresponding path program 1 times [2024-10-12 18:18:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881614927] [2024-10-12 18:18:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:18:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881614927] [2024-10-12 18:18:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881614927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851611898] [2024-10-12 18:18:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:22,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:22,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:22,666 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-10-12 18:18:22,669 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-10-12 18:18:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-12 18:18:22,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:22,981 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-10-12 18:18:23,007 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 42 treesize of output 38 [2024-10-12 18:18:23,016 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-10-12 18:18:23,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:23,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2024-10-12 18:18:23,167 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-10-12 18:18:23,195 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-10-12 18:18:23,227 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:18:23,228 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-10-12 18:18:23,244 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-10-12 18:18:23,249 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-10-12 18:18:23,380 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:18:23,380 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-10-12 18:18:23,495 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:18:23,496 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-10-12 18:18:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:23,533 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-10-12 18:18:23,612 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-10-12 18:18:23,618 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-10-12 18:18:23,624 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-10-12 18:18:23,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2024-10-12 18:18:23,747 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:18:23,747 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-10-12 18:18:23,754 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-10-12 18:18:23,762 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-10-12 18:18:23,790 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-10-12 18:18:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:23,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:24,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851611898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:24,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2024-10-12 18:18:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565720714] [2024-10-12 18:18:24,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 18:18:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 18:18:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:18:24,061 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 21 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:18:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:25,687 INFO L93 Difference]: Finished difference Result 172 states and 230 transitions. [2024-10-12 18:18:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 18:18:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-12 18:18:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:25,689 INFO L225 Difference]: With dead ends: 172 [2024-10-12 18:18:25,689 INFO L226 Difference]: Without dead ends: 149 [2024-10-12 18:18:25,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 18:18:25,691 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:25,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 227 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 18:18:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-12 18:18:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2024-10-12 18:18:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 104 states have internal predecessors, (139), 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-10-12 18:18:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 163 transitions. [2024-10-12 18:18:25,705 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 163 transitions. Word has length 27 [2024-10-12 18:18:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 163 transitions. [2024-10-12 18:18:25,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:18:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2024-10-12 18:18:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:18:25,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:25,707 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] [2024-10-12 18:18:25,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:18:25,907 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-10-12 18:18:25,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -658044300, now seen corresponding path program 1 times [2024-10-12 18:18:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428222344] [2024-10-12 18:18:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 18:18:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428222344] [2024-10-12 18:18:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428222344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655328907] [2024-10-12 18:18:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:26,300 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-10-12 18:18:26,302 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-10-12 18:18:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:18:26,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:26,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-10-12 18:18:26,655 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-10-12 18:18:26,661 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-10-12 18:18:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:26,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:26,869 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1849 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2024-10-12 18:18:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655328907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:26,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-12 18:18:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092531084] [2024-10-12 18:18:26,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:18:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:18:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-10-12 18:18:26,877 INFO L87 Difference]: Start difference. First operand 120 states and 163 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 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-10-12 18:18:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:27,426 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2024-10-12 18:18:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:18:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 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 27 [2024-10-12 18:18:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:27,427 INFO L225 Difference]: With dead ends: 172 [2024-10-12 18:18:27,427 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 18:18:27,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2024-10-12 18:18:27,428 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:27,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 211 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:18:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 18:18:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2024-10-12 18:18:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 114 states have internal predecessors, (155), 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-10-12 18:18:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-10-12 18:18:27,444 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 27 [2024-10-12 18:18:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:27,445 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-10-12 18:18:27,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 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-10-12 18:18:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-10-12 18:18:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:18:27,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:27,446 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] [2024-10-12 18:18:27,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:18:27,649 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-10-12 18:18:27,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1888175332, now seen corresponding path program 1 times [2024-10-12 18:18:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051360] [2024-10-12 18:18:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 18:18:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051360] [2024-10-12 18:18:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079122216] [2024-10-12 18:18:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:28,463 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-10-12 18:18:28,465 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-10-12 18:18:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:28,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 18:18:28,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:28,851 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-10-12 18:18:28,858 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-10-12 18:18:28,869 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-10-12 18:18:28,917 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-10-12 18:18:28,922 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-10-12 18:18:28,980 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-10-12 18:18:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:29,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079122216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:29,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-10-12 18:18:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638282037] [2024-10-12 18:18:29,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:29,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:18:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:18:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:18:29,361 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:30,656 INFO L93 Difference]: Finished difference Result 166 states and 225 transitions. [2024-10-12 18:18:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 18:18:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2024-10-12 18:18:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:30,658 INFO L225 Difference]: With dead ends: 166 [2024-10-12 18:18:30,658 INFO L226 Difference]: Without dead ends: 144 [2024-10-12 18:18:30,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:18:30,659 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:30,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 353 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 18:18:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-12 18:18:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2024-10-12 18:18:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 119 states have internal predecessors, (161), 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-10-12 18:18:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2024-10-12 18:18:30,684 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 28 [2024-10-12 18:18:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:30,685 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2024-10-12 18:18:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2024-10-12 18:18:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:18:30,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:30,687 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:30,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:18:30,887 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-10-12 18:18:30,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:30,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2139358719, now seen corresponding path program 1 times [2024-10-12 18:18:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549400503] [2024-10-12 18:18:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:18:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:18:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549400503] [2024-10-12 18:18:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549400503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391154720] [2024-10-12 18:18:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:32,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:32,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:32,681 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-10-12 18:18:32,683 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-10-12 18:18:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:33,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-12 18:18:33,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:33,075 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-10-12 18:18:33,189 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-10-12 18:18:33,243 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-10-12 18:18:33,260 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-10-12 18:18:33,279 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-10-12 18:18:33,280 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-10-12 18:18:33,290 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-10-12 18:18:33,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:33,396 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-10-12 18:18:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:33,483 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-10-12 18:18:33,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:33,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:33,499 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-12 18:18:33,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2024-10-12 18:18:33,677 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-10-12 18:18:33,677 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-10-12 18:18:33,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-10-12 18:18:33,691 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-10-12 18:18:33,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-12 18:18:33,810 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 21 treesize of output 13 [2024-10-12 18:18:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:33,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391154720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:34,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:34,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2024-10-12 18:18:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778392938] [2024-10-12 18:18:34,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:34,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 18:18:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 18:18:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=709, Unknown=1, NotChecked=0, Total=812 [2024-10-12 18:18:34,062 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 26 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:36,450 INFO L93 Difference]: Finished difference Result 183 states and 261 transitions. [2024-10-12 18:18:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 18:18:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2024-10-12 18:18:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:36,454 INFO L225 Difference]: With dead ends: 183 [2024-10-12 18:18:36,454 INFO L226 Difference]: Without dead ends: 181 [2024-10-12 18:18:36,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=2514, Unknown=1, NotChecked=0, Total=2970 [2024-10-12 18:18:36,455 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 73 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:36,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 473 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 18:18:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-12 18:18:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-10-12 18:18:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 128 states have (on average 1.3828125) internal successors, (177), 129 states have internal predecessors, (177), 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-10-12 18:18:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2024-10-12 18:18:36,475 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 28 [2024-10-12 18:18:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:36,475 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2024-10-12 18:18:36,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2024-10-12 18:18:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:18:36,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:36,476 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:36,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:36,677 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-10-12 18:18:36,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1147311774, now seen corresponding path program 2 times [2024-10-12 18:18:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729802149] [2024-10-12 18:18:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:18:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 18:18:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:39,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729802149] [2024-10-12 18:18:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729802149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:39,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268714660] [2024-10-12 18:18:39,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:18:39,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:39,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:39,154 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-10-12 18:18:39,155 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-10-12 18:18:39,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:18:39,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:18:39,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-12 18:18:39,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:39,548 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-10-12 18:18:39,751 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 48 treesize of output 41 [2024-10-12 18:18:39,759 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 49 treesize of output 15 [2024-10-12 18:18:39,768 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-10-12 18:18:39,773 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-10-12 18:18:39,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:39,931 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 50 treesize of output 52 [2024-10-12 18:18:39,944 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-10-12 18:18:39,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:39,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2024-10-12 18:18:40,133 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:18:40,133 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-10-12 18:18:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2024-10-12 18:18:40,236 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-10-12 18:18:40,248 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-10-12 18:18:40,365 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-10-12 18:18:40,372 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-10-12 18:18:40,385 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-12 18:18:40,386 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-10-12 18:18:40,487 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-10-12 18:18:40,654 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-10-12 18:18:40,657 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-10-12 18:18:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:40,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268714660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:41,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-10-12 18:18:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092594916] [2024-10-12 18:18:41,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:41,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 18:18:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 18:18:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 18:18:41,131 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 32 states, 25 states have (on average 2.16) internal successors, (54), 28 states have internal predecessors, (54), 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-10-12 18:18:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:48,207 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2024-10-12 18:18:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 18:18:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.16) internal successors, (54), 28 states have internal predecessors, (54), 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 34 [2024-10-12 18:18:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:48,210 INFO L225 Difference]: With dead ends: 451 [2024-10-12 18:18:48,211 INFO L226 Difference]: Without dead ends: 422 [2024-10-12 18:18:48,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=690, Invalid=6792, Unknown=0, NotChecked=0, Total=7482 [2024-10-12 18:18:48,214 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 200 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:48,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 965 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1676 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2024-10-12 18:18:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-12 18:18:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 254. [2024-10-12 18:18:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 218 states have (on average 1.3440366972477065) internal successors, (293), 219 states have internal predecessors, (293), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 18:18:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 347 transitions. [2024-10-12 18:18:48,250 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 347 transitions. Word has length 34 [2024-10-12 18:18:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 347 transitions. [2024-10-12 18:18:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.16) internal successors, (54), 28 states have internal predecessors, (54), 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-10-12 18:18:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2024-10-12 18:18:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 18:18:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:48,253 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 18:18:48,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:48,453 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-10-12 18:18:48,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:48,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1776626990, now seen corresponding path program 1 times [2024-10-12 18:18:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13053431] [2024-10-12 18:18:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:48,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 18:18:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:18:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 18:18:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13053431] [2024-10-12 18:18:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13053431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264511687] [2024-10-12 18:18:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:50,448 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-10-12 18:18:50,449 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-10-12 18:18:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:50,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-12 18:18:50,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:50,838 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-10-12 18:18:50,900 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-10-12 18:18:50,907 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-10-12 18:18:50,919 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-10-12 18:18:50,919 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-10-12 18:18:50,931 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-10-12 18:18:50,977 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-10-12 18:18:50,980 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-10-12 18:18:51,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:51,041 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-10-12 18:18:51,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:51,072 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-10-12 18:18:51,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:51,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:51,091 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-12 18:18:51,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2024-10-12 18:18:51,134 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 41 treesize of output 25 [2024-10-12 18:18:51,138 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-10-12 18:18:51,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:18:51,146 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-10-12 18:18:55,254 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 49 treesize of output 38 [2024-10-12 18:18:55,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 16 treesize of output 11 [2024-10-12 18:18:55,273 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:18:55,273 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-10-12 18:18:55,280 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-10-12 18:18:55,285 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-10-12 18:18:55,327 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-10-12 18:18:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:55,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:58,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (forall ((|v_append_to_queue_~#p.base_109| Int)) (or (forall ((v_append_to_queue_~node~0.base_78 Int) (v_ArrVal_3482 Int)) (or (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_109| v_ArrVal_3482) v_append_to_queue_~node~0.base_78) 0)) (forall ((v_ArrVal_3483 (Array Int Int)) (v_ArrVal_3484 (Array Int Int)) (v_ArrVal_3485 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.offset| v_append_to_queue_~node~0.base_78 v_ArrVal_3484) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3485) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)))) (< |v_append_to_queue_~#p.base_109| .cse0))) (forall ((|v_append_to_queue_~#p.base_109| Int)) (or (forall ((v_append_to_queue_~node~0.base_78 Int) (v_ArrVal_3482 Int)) (or (forall ((v_ArrVal_3483 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3486 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.base| v_append_to_queue_~node~0.base_78 v_ArrVal_3486) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3485) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_109| v_ArrVal_3482) v_append_to_queue_~node~0.base_78) 0)))) (< |v_append_to_queue_~#p.base_109| .cse0))))) is different from false [2024-10-12 18:18:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264511687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:58,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:18:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2024-10-12 18:18:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493193279] [2024-10-12 18:18:58,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:58,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 18:18:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 18:18:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=355, Unknown=3, NotChecked=38, Total=462 [2024-10-12 18:18:58,071 INFO L87 Difference]: Start difference. First operand 254 states and 347 transitions. Second operand has 19 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:59,514 INFO L93 Difference]: Finished difference Result 564 states and 780 transitions. [2024-10-12 18:18:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:18:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-10-12 18:18:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:59,518 INFO L225 Difference]: With dead ends: 564 [2024-10-12 18:18:59,518 INFO L226 Difference]: Without dead ends: 517 [2024-10-12 18:18:59,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=102, Invalid=549, Unknown=3, NotChecked=48, Total=702 [2024-10-12 18:18:59,520 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:59,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 378 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 18:18:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-12 18:18:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 393. [2024-10-12 18:18:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 340 states have (on average 1.3411764705882352) internal successors, (456), 341 states have internal predecessors, (456), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-12 18:18:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 540 transitions. [2024-10-12 18:18:59,626 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 540 transitions. Word has length 35 [2024-10-12 18:18:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:59,627 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 540 transitions. [2024-10-12 18:18:59,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:18:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 540 transitions. [2024-10-12 18:18:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 18:18:59,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:59,629 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 18:18:59,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 18:18:59,829 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-10-12 18:18:59,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 589612732, now seen corresponding path program 1 times [2024-10-12 18:18:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058134368] [2024-10-12 18:18:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:19:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:19:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:19:01,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:19:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:19:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 18:19:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:19:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:19:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:19:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058134368] [2024-10-12 18:19:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058134368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:19:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990613529] [2024-10-12 18:19:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:19:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:19:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:19:02,011 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-10-12 18:19:02,013 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-10-12 18:19:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:19:02,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-10-12 18:19:02,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:19:02,659 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-10-12 18:19:03,252 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:19:03,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 1 case distinctions, treesize of input 23 treesize of output 15 [2024-10-12 18:19:03,267 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-12 18:19:03,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-12 18:19:03,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:19:03,975 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 141 treesize of output 163 [2024-10-12 18:19:04,321 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-10-12 18:19:04,339 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-10-12 18:19:04,482 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-10-12 18:19:04,483 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 100 treesize of output 80 [2024-10-12 18:19:04,531 INFO L349 Elim1Store]: treesize reduction 64, result has 49.6 percent of original size [2024-10-12 18:19:04,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 115 [2024-10-12 18:19:04,551 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-12 18:19:04,551 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 60 treesize of output 55 [2024-10-12 18:19:05,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:19:05,231 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 164 treesize of output 136 [2024-10-12 18:19:05,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:19:05,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 102 treesize of output 114 [2024-10-12 18:19:05,985 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-10-12 18:19:05,990 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-10-12 18:19:06,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:19:06,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 45 [2024-10-12 18:19:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:19:06,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:19:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990613529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:19:07,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:19:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2024-10-12 18:19:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361922074] [2024-10-12 18:19:07,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:19:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 18:19:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:19:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 18:19:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1371, Unknown=4, NotChecked=0, Total=1482 [2024-10-12 18:19:07,187 INFO L87 Difference]: Start difference. First operand 393 states and 540 transitions. Second operand has 34 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 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-10-12 18:19:11,910 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]