./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-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:36:20,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:36:20,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:36:20,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:36:20,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:36:20,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:36:20,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:36:20,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:36:20,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:36:20,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:36:20,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:36:20,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:36:20,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:36:20,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:36:20,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:36:20,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:36:20,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:36:20,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:36:20,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:36:20,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:36:20,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:36:20,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:36:20,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:36:20,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:36:20,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:36:20,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:36:20,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:36:20,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:36:20,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:20,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:36:20,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:36:20,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:36:20,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:36:20,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:36:20,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:36:20,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:36:20,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:36:20,276 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-clean/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-clean/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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2024-10-11 01:36:20,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:36:20,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:36:20,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:36:20,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:36:20,533 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:36:20,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2024-10-11 01:36:21,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:36:22,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:36:22,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2024-10-11 01:36:22,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eaf0d70ba/982b6c4379664beab17e88bb0cc3d6b8/FLAG9bca9a695 [2024-10-11 01:36:22,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eaf0d70ba/982b6c4379664beab17e88bb0cc3d6b8 [2024-10-11 01:36:22,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:36:22,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:36:22,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:22,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:36:22,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:36:22,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb65b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22, skipping insertion in model container [2024-10-11 01:36:22,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:36:22,425 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-manipulation/merge_sort-1.i[22632,22645] [2024-10-11 01:36:22,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:22,468 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:36:22,499 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-manipulation/merge_sort-1.i[22632,22645] [2024-10-11 01:36:22,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:22,549 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:36:22,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22 WrapperNode [2024-10-11 01:36:22,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:22,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:22,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:36:22,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:36:22,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,597 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 288 [2024-10-11 01:36:22,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:22,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:36:22,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:36:22,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:36:22,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,650 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 3, 34, 10]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 2, 8, 3]. [2024-10-11 01:36:22,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:36:22,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:36:22,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:36:22,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:36:22,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (1/1) ... [2024-10-11 01:36:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:22,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:22,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:36:22,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:36:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:36:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:36:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:36:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 01:36:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-10-11 01:36:22,740 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 01:36:22,741 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:36:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:36:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 01:36:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:36:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:36:22,860 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:36:22,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:36:23,184 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-11 01:36:23,184 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:36:23,221 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:36:23,221 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-11 01:36:23,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:23 BoogieIcfgContainer [2024-10-11 01:36:23,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:36:23,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:36:23,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:36:23,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:36:23,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:22" (1/3) ... [2024-10-11 01:36:23,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c46ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:23, skipping insertion in model container [2024-10-11 01:36:23,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22" (2/3) ... [2024-10-11 01:36:23,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c46ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:23, skipping insertion in model container [2024-10-11 01:36:23,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:23" (3/3) ... [2024-10-11 01:36:23,230 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2024-10-11 01:36:23,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:36:23,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:36:23,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:36:23,307 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;@3a5c92b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:36:23,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:36:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 01:36:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:36:23,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:23,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:36:23,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -27349109, now seen corresponding path program 1 times [2024-10-11 01:36:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605731050] [2024-10-11 01:36:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:23,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:23,576 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-11 01:36:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605731050] [2024-10-11 01:36:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605731050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:36:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935530904] [2024-10-11 01:36:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:23,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:36:23,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:36:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:23,664 INFO L87 Difference]: Start difference. First operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:23,726 INFO L93 Difference]: Finished difference Result 176 states and 323 transitions. [2024-10-11 01:36:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:36:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:36:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:23,738 INFO L225 Difference]: With dead ends: 176 [2024-10-11 01:36:23,738 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 01:36:23,741 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-11 01:36:23,744 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:23,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:36:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 01:36:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 01:36:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.353846153846154) internal successors, (88), 79 states have internal predecessors, (88), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-10-11 01:36:23,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 6 [2024-10-11 01:36:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-10-11 01:36:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-10-11 01:36:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 01:36:23,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:23,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:36:23,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1471689875, now seen corresponding path program 1 times [2024-10-11 01:36:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169525228] [2024-10-11 01:36:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:23,866 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-11 01:36:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169525228] [2024-10-11 01:36:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169525228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:36:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246759349] [2024-10-11 01:36:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:36:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:36:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:36:23,869 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:23,937 INFO L93 Difference]: Finished difference Result 163 states and 209 transitions. [2024-10-11 01:36:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:36:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 01:36:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:23,939 INFO L225 Difference]: With dead ends: 163 [2024-10-11 01:36:23,939 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 01:36:23,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:36:23,942 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:23,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:36:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 01:36:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-11 01:36:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 81 states have internal predecessors, (90), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2024-10-11 01:36:23,953 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 7 [2024-10-11 01:36:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:23,953 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2024-10-11 01:36:23,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2024-10-11 01:36:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:36:23,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:23,954 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:36:23,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -884179562, now seen corresponding path program 1 times [2024-10-11 01:36:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186735761] [2024-10-11 01:36:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:24,129 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-11 01:36:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186735761] [2024-10-11 01:36:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186735761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:36:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798042474] [2024-10-11 01:36:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:36:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:36:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:36:24,134 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:24,296 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2024-10-11 01:36:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:36:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 01:36:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:24,298 INFO L225 Difference]: With dead ends: 140 [2024-10-11 01:36:24,298 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 01:36:24,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:36:24,300 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:24,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 288 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:36:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 01:36:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2024-10-11 01:36:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.323943661971831) internal successors, (94), 84 states have internal predecessors, (94), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-10-11 01:36:24,318 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 13 [2024-10-11 01:36:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:24,319 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-10-11 01:36:24,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-10-11 01:36:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:36:24,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:24,319 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-11 01:36:24,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:36:24,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:24,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1873104053, now seen corresponding path program 1 times [2024-10-11 01:36:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569815757] [2024-10-11 01:36:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:24,458 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-11 01:36:24,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569815757] [2024-10-11 01:36:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569815757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:24,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:24,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:36:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722911028] [2024-10-11 01:36:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:24,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:36:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:24,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:36:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:36:24,459 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:24,619 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-10-11 01:36:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:36:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 01:36:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:24,621 INFO L225 Difference]: With dead ends: 89 [2024-10-11 01:36:24,621 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 01:36:24,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:36:24,623 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:24,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 292 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:36:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 01:36:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 01:36:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 83 states have internal predecessors, (93), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-10-11 01:36:24,639 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 20 [2024-10-11 01:36:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:24,639 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-10-11 01:36:24,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-10-11 01:36:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:36:24,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:24,640 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-11 01:36:24,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:36:24,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1547688063, now seen corresponding path program 1 times [2024-10-11 01:36:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129466906] [2024-10-11 01:36:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:24,803 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-11 01:36:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129466906] [2024-10-11 01:36:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129466906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:36:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914839182] [2024-10-11 01:36:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:36:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:36:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:36:24,809 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:24,991 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-10-11 01:36:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:36:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 01:36:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:24,992 INFO L225 Difference]: With dead ends: 88 [2024-10-11 01:36:24,993 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 01:36:24,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:36:24,993 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 12 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:24,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 286 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:36:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 01:36:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 01:36:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.295774647887324) internal successors, (92), 82 states have internal predecessors, (92), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-10-11 01:36:25,001 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 20 [2024-10-11 01:36:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:25,001 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-10-11 01:36:25,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-10-11 01:36:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:36:25,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:25,003 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:25,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:36:25,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1608452687, now seen corresponding path program 1 times [2024-10-11 01:36:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:25,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822448284] [2024-10-11 01:36:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:25,138 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-11 01:36:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822448284] [2024-10-11 01:36:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822448284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:36:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725896052] [2024-10-11 01:36:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:36:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:36:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:36:25,140 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:25,358 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2024-10-11 01:36:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:36:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 01:36:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:25,359 INFO L225 Difference]: With dead ends: 135 [2024-10-11 01:36:25,359 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 01:36:25,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:36:25,360 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 109 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:25,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 300 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:36:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 01:36:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 91. [2024-10-11 01:36:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 88 states have internal predecessors, (98), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2024-10-11 01:36:25,376 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 23 [2024-10-11 01:36:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:25,376 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-11 01:36:25,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2024-10-11 01:36:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:36:25,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:25,377 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:25,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:36:25,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:25,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -821516206, now seen corresponding path program 1 times [2024-10-11 01:36:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:25,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582445279] [2024-10-11 01:36:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:25,458 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-11 01:36:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582445279] [2024-10-11 01:36:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582445279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:36:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003336163] [2024-10-11 01:36:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:36:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:36:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:36:25,460 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:25,664 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2024-10-11 01:36:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:36:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 01:36:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:25,666 INFO L225 Difference]: With dead ends: 134 [2024-10-11 01:36:25,666 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 01:36:25,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:36:25,667 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:25,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 300 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:36:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 01:36:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-10-11 01:36:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 94 states have internal predecessors, (104), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-11 01:36:25,679 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 23 [2024-10-11 01:36:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:25,679 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-11 01:36:25,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-11 01:36:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:36:25,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:25,680 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] [2024-10-11 01:36:25,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:36:25,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1369779320, now seen corresponding path program 1 times [2024-10-11 01:36:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109505845] [2024-10-11 01:36:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:26,016 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-11 01:36:26,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109505845] [2024-10-11 01:36:26,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109505845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:36:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96784963] [2024-10-11 01:36:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:36:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:26,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:36:26,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:36:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:26,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 01:36:26,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:26,219 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 18 treesize of output 7 [2024-10-11 01:36:26,224 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 18 treesize of output 7 [2024-10-11 01:36:26,263 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-11 01:36:26,281 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-11 01:36:26,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:36:26,363 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-11 01:36:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96784963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:36:26,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:36:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2024-10-11 01:36:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800392210] [2024-10-11 01:36:26,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:36:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:36:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:26,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:36:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:36:26,365 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:26,623 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2024-10-11 01:36:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:36:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 01:36:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:26,624 INFO L225 Difference]: With dead ends: 219 [2024-10-11 01:36:26,624 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 01:36:26,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 01:36:26,625 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 94 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:26,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 548 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:36:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 01:36:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 108. [2024-10-11 01:36:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 105 states have internal predecessors, (116), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:36:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2024-10-11 01:36:26,641 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 26 [2024-10-11 01:36:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2024-10-11 01:36:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2024-10-11 01:36:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:36:26,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:26,642 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] [2024-10-11 01:36:26,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:36:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:36:26,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:26,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1171618610, now seen corresponding path program 1 times [2024-10-11 01:36:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815880301] [2024-10-11 01:36:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:36:26,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:36:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:36:26,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:36:26,928 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:36:26,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:36:26,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 01:36:26,933 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:26,953 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:36:26,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:36:26 BoogieIcfgContainer [2024-10-11 01:36:26,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:36:26,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:36:26,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:36:26,958 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:36:26,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:23" (3/4) ... [2024-10-11 01:36:26,959 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:36:26,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:36:26,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:36:26,996 INFO L158 Benchmark]: Toolchain (without parser) took 4897.17ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 55.8MB in the beginning and 267.1MB in the end (delta: -211.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:36:26,996 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 98.7MB in the beginning and 98.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:36:26,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.68ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 55.6MB in the beginning and 174.8MB in the end (delta: -119.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.52ms. Allocated memory is still 211.8MB. Free memory was 174.8MB in the beginning and 172.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,997 INFO L158 Benchmark]: Boogie Preprocessor took 72.42ms. Allocated memory is still 211.8MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,997 INFO L158 Benchmark]: RCFGBuilder took 550.88ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 135.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,997 INFO L158 Benchmark]: TraceAbstraction took 3733.42ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 134.0MB in the beginning and 269.2MB in the end (delta: -135.2MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,998 INFO L158 Benchmark]: Witness Printer took 38.29ms. Allocated memory is still 308.3MB. Free memory was 269.2MB in the beginning and 267.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:36:26,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 98.7MB in the beginning and 98.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.68ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 55.6MB in the beginning and 174.8MB in the end (delta: -119.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.52ms. Allocated memory is still 211.8MB. Free memory was 174.8MB in the beginning and 172.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.42ms. Allocated memory is still 211.8MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 550.88ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 135.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3733.42ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 134.0MB in the beginning and 269.2MB in the end (delta: -135.2MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. * Witness Printer took 38.29ms. Allocated memory is still 308.3MB. Free memory was 269.2MB in the beginning and 267.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}] [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}] [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 2315 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1634 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 681 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 162 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1062 SizeOfPredicates, 3 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 01:36:27,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE