./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:31:07,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:31:07,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:31:07,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:31:07,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:31:07,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:31:07,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:31:07,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:31:07,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:31:07,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:31:07,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:31:07,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:31:07,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:31:07,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:31:07,317 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:31:07,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:31:07,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:31:07,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:31:07,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:31:07,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:31:07,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:31:07,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:31:07,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:31:07,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:31:07,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:31:07,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:31:07,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:31:07,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:31:07,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:31:07,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:31:07,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:31:07,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:31:07,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:31:07,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:31:07,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:31:07,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:31:07,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:31:07,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:31:07,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:31:07,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:31:07,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:31:07,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:31:07,328 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:31:07,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:31:07,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:31:07,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:31:07,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:31:07,624 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:31:07,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-11 20:31:09,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:31:09,233 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:31:09,234 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-11 20:31:09,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/991c09093/6c703ed8506d4c80a6f71d0d286db913/FLAG4a7c4cf2b [2024-09-11 20:31:09,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/991c09093/6c703ed8506d4c80a6f71d0d286db913 [2024-09-11 20:31:09,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:31:09,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:31:09,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:31:09,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:31:09,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:31:09,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b39e4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09, skipping insertion in model container [2024-09-11 20:31:09,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:31:09,846 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-09-11 20:31:09,864 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-09-11 20:31:09,870 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-09-11 20:31:09,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:31:09,890 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:31:09,909 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-09-11 20:31:09,913 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-09-11 20:31:09,915 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-09-11 20:31:09,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:31:09,934 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:31:09,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09 WrapperNode [2024-09-11 20:31:09,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:31:09,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:31:09,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:31:09,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:31:09,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,969 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-09-11 20:31:09,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:31:09,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:31:09,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:31:09,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:31:09,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:09,999 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-09-11 20:31:10,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:31:10,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:31:10,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:31:10,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:31:10,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (1/1) ... [2024-09-11 20:31:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:31:10,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:31:10,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:31:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:31:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 20:31:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 20:31:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-09-11 20:31:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-09-11 20:31:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:31:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:31:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 20:31:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 20:31:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 20:31:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 20:31:10,167 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:31:10,170 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:31:10,389 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-09-11 20:31:10,389 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:31:10,420 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:31:10,421 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:31:10,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:31:10 BoogieIcfgContainer [2024-09-11 20:31:10,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:31:10,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:31:10,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:31:10,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:31:10,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:31:09" (1/3) ... [2024-09-11 20:31:10,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451a3697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:31:10, skipping insertion in model container [2024-09-11 20:31:10,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:31:09" (2/3) ... [2024-09-11 20:31:10,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451a3697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:31:10, skipping insertion in model container [2024-09-11 20:31:10,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:31:10" (3/3) ... [2024-09-11 20:31:10,432 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-11 20:31:10,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:31:10,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-11 20:31:10,548 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:31:10,554 INFO L336 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=All, 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;@54d1450b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:31:10,555 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-11 20:31:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 33 states have internal predecessors, (47), 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-09-11 20:31:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 20:31:10,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:10,566 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:10,566 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:10,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1723010819, now seen corresponding path program 1 times [2024-09-11 20:31:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:10,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637966281] [2024-09-11 20:31:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:31:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637966281] [2024-09-11 20:31:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637966281] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:31:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483908438] [2024-09-11 20:31:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:11,259 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:31:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:31:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:31:11,286 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 33 states have internal predecessors, (47), 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.4) internal successors, (12), 4 states have internal predecessors, (12), 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-09-11 20:31:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:11,409 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2024-09-11 20:31:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:31:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-09-11 20:31:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:11,421 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:31:11,421 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 20:31:11,425 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-09-11 20:31:11,430 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:11,432 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 199 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:31:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 20:31:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-11 20:31:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 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-09-11 20:31:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-11 20:31:11,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2024-09-11 20:31:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:11,469 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-11 20:31:11,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-09-11 20:31:11,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-11 20:31:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 20:31:11,475 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:11,475 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:11,475 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:31:11,477 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:11,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1314094639, now seen corresponding path program 1 times [2024-09-11 20:31:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273452375] [2024-09-11 20:31:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:31:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273452375] [2024-09-11 20:31:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273452375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 20:31:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435120321] [2024-09-11 20:31:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:11,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 20:31:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 20:31:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:31:11,667 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-09-11 20:31:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:11,706 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-09-11 20:31:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:31:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2024-09-11 20:31:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:11,709 INFO L225 Difference]: With dead ends: 42 [2024-09-11 20:31:11,709 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:31:11,710 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-11 20:31:11,712 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:11,712 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 91 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:31:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:31:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-11 20:31:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 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-09-11 20:31:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-09-11 20:31:11,726 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 19 [2024-09-11 20:31:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:11,726 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-09-11 20:31:11,727 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-09-11 20:31:11,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-09-11 20:31:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:31:11,729 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:11,729 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:11,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:31:11,730 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:11,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 31900066, now seen corresponding path program 1 times [2024-09-11 20:31:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174510191] [2024-09-11 20:31:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:31:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174510191] [2024-09-11 20:31:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174510191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 20:31:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570023943] [2024-09-11 20:31:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:11,815 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 20:31:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 20:31:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:31:11,818 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-09-11 20:31:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:11,889 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2024-09-11 20:31:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:31:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 20 [2024-09-11 20:31:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:11,891 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:31:11,892 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:31:11,893 INFO L433 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-09-11 20:31:11,894 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:11,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:31:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:31:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-09-11 20:31:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 31 states have internal predecessors, (36), 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-09-11 20:31:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-11 20:31:11,911 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2024-09-11 20:31:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:11,911 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-11 20:31:11,912 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-09-11 20:31:11,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-11 20:31:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:31:11,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:11,913 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:11,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:31:11,913 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:11,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -36589443, now seen corresponding path program 1 times [2024-09-11 20:31:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066299402] [2024-09-11 20:31:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:11,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:31:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:12,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066299402] [2024-09-11 20:31:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066299402] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:31:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135289733] [2024-09-11 20:31:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:12,006 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:31:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:31:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:31:12,008 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-09-11 20:31:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:12,064 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-09-11 20:31:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:31:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2024-09-11 20:31:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:12,069 INFO L225 Difference]: With dead ends: 39 [2024-09-11 20:31:12,069 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:31:12,069 INFO L433 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-09-11 20:31:12,070 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:12,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:31:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:31:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-11 20:31:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 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-09-11 20:31:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-11 20:31:12,088 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2024-09-11 20:31:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:12,088 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-11 20:31:12,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-09-11 20:31:12,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-11 20:31:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 20:31:12,091 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:12,091 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:12,092 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 20:31:12,092 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:12,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1072310333, now seen corresponding path program 1 times [2024-09-11 20:31:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:12,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200989468] [2024-09-11 20:31:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:31:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200989468] [2024-09-11 20:31:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200989468] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 20:31:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269702779] [2024-09-11 20:31:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:12,156 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 20:31:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 20:31:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:31:12,157 INFO L87 Difference]: Start difference. First operand 37 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-09-11 20:31:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:12,212 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-09-11 20:31:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:31:12,213 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-09-11 20:31:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:12,214 INFO L225 Difference]: With dead ends: 58 [2024-09-11 20:31:12,214 INFO L226 Difference]: Without dead ends: 38 [2024-09-11 20:31:12,214 INFO L433 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-09-11 20:31:12,215 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:12,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 68 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:31:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-11 20:31:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-09-11 20:31:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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-09-11 20:31:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-09-11 20:31:12,230 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2024-09-11 20:31:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:12,230 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-09-11 20:31:12,231 INFO L475 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-09-11 20:31:12,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-09-11 20:31:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 20:31:12,232 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:12,232 INFO L216 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] [2024-09-11 20:31:12,232 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 20:31:12,232 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:12,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1379392323, now seen corresponding path program 1 times [2024-09-11 20:31:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480247009] [2024-09-11 20:31:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:31:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480247009] [2024-09-11 20:31:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480247009] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:31:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149278284] [2024-09-11 20:31:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:31:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:31:12,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:31:12,806 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:31:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:12,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:31:12,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:31:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:31:13,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:31:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:31:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149278284] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:31:13,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:31:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-09-11 20:31:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189483068] [2024-09-11 20:31:13,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:31:13,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:31:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:31:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:31:13,627 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 23 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-11 20:31:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:13,938 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-09-11 20:31:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:31:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-09-11 20:31:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:13,940 INFO L225 Difference]: With dead ends: 66 [2024-09-11 20:31:13,940 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:31:13,940 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2024-09-11 20:31:13,941 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:13,941 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 304 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:31:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:31:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-11 20:31:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:31:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-09-11 20:31:13,958 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2024-09-11 20:31:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:13,959 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-09-11 20:31:13,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-11 20:31:13,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-09-11 20:31:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 20:31:13,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:13,961 INFO L216 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] [2024-09-11 20:31:13,978 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:31:14,165 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:31:14,166 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:14,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash 845071163, now seen corresponding path program 2 times [2024-09-11 20:31:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616258661] [2024-09-11 20:31:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:14,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:15,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:15,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:16,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:16,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:31:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616258661] [2024-09-11 20:31:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616258661] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:31:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016493866] [2024-09-11 20:31:16,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:31:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:31:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:31:16,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:31:16,286 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:31:16,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-11 20:31:16,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:31:16,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-11 20:31:16,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:31:18,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-11 20:31:18,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-11 20:31:18,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 20:31:18,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:31:18,285 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 485 treesize of output 259 [2024-09-11 20:31:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-11 20:31:18,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:31:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016493866] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:18,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:31:18,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2024-09-11 20:31:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367541422] [2024-09-11 20:31:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:18,588 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 20:31:18,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 20:31:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:31:18,589 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-09-11 20:31:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:18,850 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-11 20:31:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:31:18,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 41 [2024-09-11 20:31:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:18,852 INFO L225 Difference]: With dead ends: 56 [2024-09-11 20:31:18,852 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:31:18,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:31:18,854 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:18,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 60 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:31:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:31:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-11 20:31:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:31:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-11 20:31:18,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 41 [2024-09-11 20:31:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:18,867 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-11 20:31:18,867 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-09-11 20:31:18,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-11 20:31:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 20:31:18,868 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:31:18,870 INFO L216 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-09-11 20:31:18,887 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:31:19,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:31:19,075 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:31:19,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash -254003148, now seen corresponding path program 1 times [2024-09-11 20:31:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:31:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526615186] [2024-09-11 20:31:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:31:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:31:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:31:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:31:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:31:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-11 20:31:19,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:31:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526615186] [2024-09-11 20:31:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526615186] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:31:19,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:31:19,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:31:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772535183] [2024-09-11 20:31:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:31:19,227 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:31:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:31:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:31:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:31:19,228 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-09-11 20:31:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:31:19,286 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-11 20:31:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:31:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 42 [2024-09-11 20:31:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:31:19,287 INFO L225 Difference]: With dead ends: 35 [2024-09-11 20:31:19,287 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:31:19,288 INFO L433 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-09-11 20:31:19,288 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:31:19,288 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:31:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:31:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:31:19,289 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-09-11 20:31:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:31:19,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-09-11 20:31:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:31:19,290 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:31:19,290 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-09-11 20:31:19,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:31:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:31:19,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:31:19,296 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-09-11 20:31:19,296 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-09-11 20:31:19,297 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-09-11 20:31:19,297 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 20:31:19,300 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:31:19,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:31:19,731 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:31:19,744 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,746 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,747 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,747 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,750 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,752 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,752 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,752 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,753 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,753 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,753 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:31:19,753 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-11 20:31:19,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:31:19 BoogieIcfgContainer [2024-09-11 20:31:19,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:31:19,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:31:19,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:31:19,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:31:19,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:31:10" (3/4) ... [2024-09-11 20:31:19,761 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:31:19,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2024-09-11 20:31:19,770 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-09-11 20:31:19,771 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:31:19,772 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:31:19,772 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:31:19,870 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:31:19,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:31:19,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:31:19,874 INFO L158 Benchmark]: Toolchain (without parser) took 10242.49ms. Allocated memory was 163.6MB in the beginning and 320.9MB in the end (delta: 157.3MB). Free memory was 108.2MB in the beginning and 126.5MB in the end (delta: -18.3MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,874 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 124.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:31:19,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.17ms. Allocated memory is still 163.6MB. Free memory was 108.2MB in the beginning and 94.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 93.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,875 INFO L158 Benchmark]: Boogie Preprocessor took 43.87ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 90.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,875 INFO L158 Benchmark]: RCFGBuilder took 406.93ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 73.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,875 INFO L158 Benchmark]: TraceAbstraction took 9333.66ms. Allocated memory was 163.6MB in the beginning and 320.9MB in the end (delta: 157.3MB). Free memory was 73.0MB in the beginning and 132.8MB in the end (delta: -59.8MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,876 INFO L158 Benchmark]: Witness Printer took 115.28ms. Allocated memory is still 320.9MB. Free memory was 132.8MB in the beginning and 126.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:31:19,878 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.14ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 124.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.17ms. Allocated memory is still 163.6MB. Free memory was 108.2MB in the beginning and 94.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 93.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.87ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 90.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.93ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 73.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9333.66ms. Allocated memory was 163.6MB in the beginning and 320.9MB in the end (delta: 157.3MB). Free memory was 73.0MB in the beginning and 132.8MB in the end (delta: -59.8MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. * Witness Printer took 115.28ms. Allocated memory is still 320.9MB. Free memory was 132.8MB in the beginning and 126.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] * 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, 36 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 1016 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 776 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 240 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 270 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457 SizeOfPredicates, 13 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 56 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 - InvariantResult [Line: 53]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 111]: Location Invariant Derived location invariant: (((((((long long) main__index2 + 1) % 4294967296) <= 99999) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main____CPAchecker_TMP_0 != 0)) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999)) - InvariantResult [Line: 109]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 72]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 155]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 155]: Location Invariant Derived location invariant: ((main__loop_entered == 0) || (((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296)))) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) || ((((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999))) - InvariantResult [Line: 74]: Location Invariant Derived location invariant: ((((main__loop_entered == 0) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main____CPAchecker_TMP_0 == 1)) && ((main__index2 % 4294967296) <= 99999)) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:31:19,911 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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