./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:13:45,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:13:45,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:13:45,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:13:45,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:13:45,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:13:45,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:13:45,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:13:45,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:13:45,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:13:45,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:13:45,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:13:45,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:13:45,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:13:45,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:13:45,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:13:45,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:13:45,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:13:45,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:13:45,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:13:45,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:13:45,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:13:45,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:13:45,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:13:45,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:13:45,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:13:45,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:13:45,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:13:45,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:13:45,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:13:45,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:13:45,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:13:45,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:13:45,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:13:45,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:13:45,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:13:45,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:13:45,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:13:45,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:13:45,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:13:45,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:13:45,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:13:45,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 [2024-11-19 22:13:46,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:13:46,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:13:46,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:13:46,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:13:46,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:13:46,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-19 22:13:47,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:13:47,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:13:47,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-19 22:13:47,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89871359e/792eaefa2459405b95d387d4de46800a/FLAG76bf06e16 [2024-11-19 22:13:48,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89871359e/792eaefa2459405b95d387d4de46800a [2024-11-19 22:13:48,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:13:48,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:13:48,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:13:48,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:13:48,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:13:48,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4826b997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48, skipping insertion in model container [2024-11-19 22:13:48,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:13:48,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-11-19 22:13:48,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-11-19 22:13:48,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-11-19 22:13:48,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:13:48,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:13:48,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-11-19 22:13:48,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-11-19 22:13:48,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-11-19 22:13:48,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:13:48,414 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:13:48,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48 WrapperNode [2024-11-19 22:13:48,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:13:48,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:13:48,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:13:48,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:13:48,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,464 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-19 22:13:48,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:13:48,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:13:48,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:13:48,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:13:48,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,503 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 22:13:48,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:13:48,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:13:48,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:13:48,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:13:48,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (1/1) ... [2024-11-19 22:13:48,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:13:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:13:48,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:13:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:13:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:13:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:13:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 22:13:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 22:13:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 22:13:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 22:13:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 22:13:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 22:13:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-11-19 22:13:48,601 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-11-19 22:13:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:13:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:13:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 22:13:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 22:13:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 22:13:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 22:13:48,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:13:48,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:13:48,935 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 22:13:48,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:13:48,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:13:48,950 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:13:48,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:48 BoogieIcfgContainer [2024-11-19 22:13:48,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:13:48,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:13:48,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:13:48,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:13:48,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:13:48" (1/3) ... [2024-11-19 22:13:48,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36789ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:13:48, skipping insertion in model container [2024-11-19 22:13:48,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:13:48" (2/3) ... [2024-11-19 22:13:48,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36789ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:13:48, skipping insertion in model container [2024-11-19 22:13:48,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:48" (3/3) ... [2024-11-19 22:13:48,960 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-19 22:13:48,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:13:48,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 22:13:49,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:13:49,030 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;@55c8fc96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:13:49,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 22:13:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:13:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 22:13:49,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:49,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:49,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:49,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash -595755826, now seen corresponding path program 1 times [2024-11-19 22:13:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375062086] [2024-11-19 22:13:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:13:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375062086] [2024-11-19 22:13:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375062086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:49,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:13:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052829712] [2024-11-19 22:13:49,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:13:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:13:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:13:49,763 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:13:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:49,870 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2024-11-19 22:13:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:13:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 22:13:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:49,880 INFO L225 Difference]: With dead ends: 70 [2024-11-19 22:13:49,881 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 22:13:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:13:49,888 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:49,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 216 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 22:13:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 22:13:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:13:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-19 22:13:49,920 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 15 [2024-11-19 22:13:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:49,921 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-19 22:13:49,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:13:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-19 22:13:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 22:13:49,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:49,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:49,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:13:49,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1530529050, now seen corresponding path program 1 times [2024-11-19 22:13:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546347127] [2024-11-19 22:13:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:13:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546347127] [2024-11-19 22:13:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546347127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:13:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398638634] [2024-11-19 22:13:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:13:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:13:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,092 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:13:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:50,125 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-19 22:13:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:13:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-19 22:13:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:50,127 INFO L225 Difference]: With dead ends: 43 [2024-11-19 22:13:50,127 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 22:13:50,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,128 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:50,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 22:13:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-19 22:13:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:13:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-19 22:13:50,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 20 [2024-11-19 22:13:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:50,142 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-19 22:13:50,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:13:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-19 22:13:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 22:13:50,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:50,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:13:50,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:50,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1912367917, now seen corresponding path program 1 times [2024-11-19 22:13:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602733310] [2024-11-19 22:13:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:13:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602733310] [2024-11-19 22:13:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602733310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:13:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993557934] [2024-11-19 22:13:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:50,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:13:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:13:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,231 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:50,282 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-11-19 22:13:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:13:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 22:13:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:50,283 INFO L225 Difference]: With dead ends: 63 [2024-11-19 22:13:50,283 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 22:13:50,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,285 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:50,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 22:13:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-19 22:13:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:13:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-19 22:13:50,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2024-11-19 22:13:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-19 22:13:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-19 22:13:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 22:13:50,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:50,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:13:50,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1843878408, now seen corresponding path program 1 times [2024-11-19 22:13:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603997973] [2024-11-19 22:13:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:13:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603997973] [2024-11-19 22:13:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603997973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:13:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271280503] [2024-11-19 22:13:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:13:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:13:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:13:50,381 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:50,426 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-19 22:13:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:13:50,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 22:13:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:50,428 INFO L225 Difference]: With dead ends: 40 [2024-11-19 22:13:50,428 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 22:13:50,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-11-19 22:13:50,429 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:50,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 131 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 22:13:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 22:13:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:13:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-19 22:13:50,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-11-19 22:13:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:50,440 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-19 22:13:50,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-19 22:13:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 22:13:50,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:50,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:13:50,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1387618200, now seen corresponding path program 1 times [2024-11-19 22:13:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113497874] [2024-11-19 22:13:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:13:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113497874] [2024-11-19 22:13:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113497874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:13:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144213932] [2024-11-19 22:13:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:50,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:13:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:13:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,508 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:50,550 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-19 22:13:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:13:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 22:13:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:50,551 INFO L225 Difference]: With dead ends: 59 [2024-11-19 22:13:50,551 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 22:13:50,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:13:50,552 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:50,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 22:13:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-11-19 22:13:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:13:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-19 22:13:50,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2024-11-19 22:13:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:50,558 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-19 22:13:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-19 22:13:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 22:13:50,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:50,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:50,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:13:50,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1338164728, now seen corresponding path program 1 times [2024-11-19 22:13:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959992206] [2024-11-19 22:13:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:50,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:13:51,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:51,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959992206] [2024-11-19 22:13:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959992206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:13:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525499576] [2024-11-19 22:13:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:13:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:13:51,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:13:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:13:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:51,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 22:13:51,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:13:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:13:51,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:13:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:13:52,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525499576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:13:52,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:13:52,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 26 [2024-11-19 22:13:52,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242760926] [2024-11-19 22:13:52,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:13:52,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 22:13:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 22:13:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-11-19 22:13:52,224 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 26 states, 20 states have (on average 2.0) internal successors, (40), 22 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 22:13:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:52,945 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2024-11-19 22:13:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 22:13:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.0) internal successors, (40), 22 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-11-19 22:13:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:52,946 INFO L225 Difference]: With dead ends: 78 [2024-11-19 22:13:52,947 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 22:13:52,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 22:13:52,948 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:52,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 437 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:13:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 22:13:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-19 22:13:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 22:13:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-19 22:13:52,956 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2024-11-19 22:13:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-19 22:13:52,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.0) internal successors, (40), 22 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 22:13:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-19 22:13:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 22:13:52,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:52,958 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:52,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:13:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 22:13:53,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1681460880, now seen corresponding path program 2 times [2024-11-19 22:13:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734589689] [2024-11-19 22:13:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 22:13:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734589689] [2024-11-19 22:13:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734589689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:13:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046627505] [2024-11-19 22:13:55,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 22:13:55,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:13:55,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:13:55,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:13:55,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:13:55,253 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 22:13:55,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:13:55,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 22:13:55,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:13:57,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 22:13:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 22:13:57,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 22:13:57,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 22:13:57,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 22:13:57,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 22:13:57,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 22:13:57,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 22:13:57,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 988 treesize of output 568 [2024-11-19 22:13:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 22:13:57,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:13:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046627505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:13:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2024-11-19 22:13:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814023746] [2024-11-19 22:13:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:13:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:13:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:13:57,726 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:13:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:58,029 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-19 22:13:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:13:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-19 22:13:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:58,035 INFO L225 Difference]: With dead ends: 60 [2024-11-19 22:13:58,035 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 22:13:58,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:13:58,036 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:58,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:13:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 22:13:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-19 22:13:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 22:13:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-19 22:13:58,051 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2024-11-19 22:13:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-19 22:13:58,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:13:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-19 22:13:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:13:58,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:13:58,053 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:58,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:13:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 22:13:58,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:13:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:13:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -95725697, now seen corresponding path program 1 times [2024-11-19 22:13:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:13:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976847997] [2024-11-19 22:13:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:13:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:13:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:13:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:13:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 22:13:58,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:13:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976847997] [2024-11-19 22:13:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976847997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:13:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:13:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:13:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098885707] [2024-11-19 22:13:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:13:58,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:13:58,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:13:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:13:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:13:58,426 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:13:58,472 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-19 22:13:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:13:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-19 22:13:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:13:58,473 INFO L225 Difference]: With dead ends: 39 [2024-11-19 22:13:58,473 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:13:58,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:13:58,475 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:13:58,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:13:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:13:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:13:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:13:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:13:58,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2024-11-19 22:13:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:13:58,478 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:13:58,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:13:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:13:58,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:13:58,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-19 22:13:58,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 22:13:58,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-19 22:13:58,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:13:58,487 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-19 22:13:58,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:13:58,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:13:58,664 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_22_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-11-19 22:13:58,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:13:58 BoogieIcfgContainer [2024-11-19 22:13:58,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:13:58,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:13:58,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:13:58,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:13:58,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:13:48" (3/4) ... [2024-11-19 22:13:58,678 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 22:13:58,681 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2024-11-19 22:13:58,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-19 22:13:58,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 22:13:58,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 22:13:58,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:13:58,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:13:58,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 22:13:58,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:13:58,778 INFO L158 Benchmark]: Toolchain (without parser) took 10716.78ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 114.2MB in the beginning and 159.5MB in the end (delta: -45.3MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,778 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:13:58,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.54ms. Allocated memory is still 161.5MB. Free memory was 114.2MB in the beginning and 99.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.45ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,779 INFO L158 Benchmark]: Boogie Preprocessor took 54.59ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,780 INFO L158 Benchmark]: RCFGBuilder took 428.08ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 78.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,780 INFO L158 Benchmark]: TraceAbstraction took 9720.49ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 77.9MB in the beginning and 164.8MB in the end (delta: -86.9MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,780 INFO L158 Benchmark]: Witness Printer took 104.08ms. Allocated memory is still 339.7MB. Free memory was 164.8MB in the beginning and 159.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 22:13:58,781 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.18ms. Allocated memory is still 161.5MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.54ms. Allocated memory is still 161.5MB. Free memory was 114.2MB in the beginning and 99.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.45ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.59ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.08ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 78.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9720.49ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 77.9MB in the beginning and 164.8MB in the end (delta: -86.9MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. * Witness Printer took 104.08ms. Allocated memory is still 339.7MB. Free memory was 164.8MB in the beginning and 159.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 170]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1201 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 939 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 262 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 61, 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, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 280 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 1564 SizeOfPredicates, 16 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 120/166 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - ProcedureContractResult [Line: 36]: Procedure Contract for func_to_recursive_line_20_to_22_0 Derived contract for procedure func_to_recursive_line_20_to_22_0. Ensures: (((__return_main == \old(__return_main)) && (__tmp_155_0 == \old(__tmp_155_0))) && (__return_136 == \old(__return_136))) RESULT: Ultimate proved your program to be correct! [2024-11-19 22:13:58,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE