./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_vardep_1.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 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:16:05,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:16:05,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:16:05,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:16:05,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:16:05,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:16:05,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:16:05,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:16:05,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:16:05,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:16:05,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:16:05,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:16:05,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:16:05,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:16:05,104 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:16:05,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:16:05,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:16:05,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:16:05,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:16:05,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:16:05,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:16:05,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:16:05,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:16:05,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:16:05,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:16:05,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:16:05,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:16:05,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:16:05,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:16:05,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:16:05,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:16:05,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:16:05,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:16:05,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:16:05,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:16:05,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:16:05,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:16:05,109 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 -> 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:16:05,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:16:05,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:16:05,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:16:05,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:16:05,309 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:16:05,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2024-10-15 15:16:06,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:16:06,618 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:16:06,620 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2024-10-15 15:16:06,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/574cfdfb4/39c79d6dc29a4d4191de52d092009392/FLAGcce6fa5e3 [2024-10-15 15:16:06,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/574cfdfb4/39c79d6dc29a4d4191de52d092009392 [2024-10-15 15:16:06,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:16:06,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:16:06,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:16:06,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:16:06,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:16:06,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71452a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06, skipping insertion in model container [2024-10-15 15:16:06,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:16:06,796 WARN L248 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_vardep_1.c[1113,1126] [2024-10-15 15:16:06,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:16:06,814 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:16:06,822 WARN L248 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_vardep_1.c[1113,1126] [2024-10-15 15:16:06,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:16:06,836 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:16:06,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06 WrapperNode [2024-10-15 15:16:06,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:16:06,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:16:06,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:16:06,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:16:06,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,852 INFO L138 Inliner]: procedures = 14, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:16:06,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:16:06,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:16:06,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:16:06,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:16:06,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,882 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [2, 4, 5, 4]. 33 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-10-15 15:16:06,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:16:06,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:16:06,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:16:06,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:16:06,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (1/1) ... [2024-10-15 15:16:06,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:16:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:06,923 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-10-15 15:16:06,924 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-10-15 15:16:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:16:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:16:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:16:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:16:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:16:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 15:16:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-15 15:16:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 15:16:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 15:16:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 15:16:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 15:16:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-15 15:16:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:16:06,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:16:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:16:06,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:16:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:16:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:16:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 15:16:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-15 15:16:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:16:06,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:16:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_25_0 [2024-10-15 15:16:06,966 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_25_0 [2024-10-15 15:16:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:16:07,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:16:07,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:16:07,181 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-15 15:16:07,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:16:07,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:16:07,204 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:16:07,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:16:07 BoogieIcfgContainer [2024-10-15 15:16:07,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:16:07,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:16:07,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:16:07,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:16:07,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:16:06" (1/3) ... [2024-10-15 15:16:07,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f1808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:16:07, skipping insertion in model container [2024-10-15 15:16:07,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:06" (2/3) ... [2024-10-15 15:16:07,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f1808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:16:07, skipping insertion in model container [2024-10-15 15:16:07,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:16:07" (3/3) ... [2024-10-15 15:16:07,213 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_1.c [2024-10-15 15:16:07,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:16:07,226 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:16:07,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:16:07,282 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@376fc563, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:16:07,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:16:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-15 15:16:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-15 15:16:07,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:07,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:16:07,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:07,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1671296621, now seen corresponding path program 1 times [2024-10-15 15:16:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:07,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910553114] [2024-10-15 15:16:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:16:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:08,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910553114] [2024-10-15 15:16:08,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910553114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:16:08,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:16:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 15:16:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292921293] [2024-10-15 15:16:08,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:16:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 15:16:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 15:16:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:16:08,211 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:16:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:08,331 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-10-15 15:16:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 15:16:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-15 15:16:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:08,337 INFO L225 Difference]: With dead ends: 51 [2024-10-15 15:16:08,337 INFO L226 Difference]: Without dead ends: 25 [2024-10-15 15:16:08,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-15 15:16:08,342 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:16:08,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:16:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-15 15:16:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-15 15:16:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 15:16:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-10-15 15:16:08,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 12 [2024-10-15 15:16:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:08,365 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-10-15 15:16:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:16:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-10-15 15:16:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 15:16:08,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:08,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:16:08,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:16:08,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 345612298, now seen corresponding path program 1 times [2024-10-15 15:16:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380550602] [2024-10-15 15:16:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:09,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-15 15:16:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:16:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380550602] [2024-10-15 15:16:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380550602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733255593] [2024-10-15 15:16:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:09,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:09,154 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-10-15 15:16:09,155 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:16:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:09,469 WARN L253 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-15 15:16:09,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:16:09,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 15:16:09,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 15:16:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-15 15:16:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:16:09,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:16:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 15:16:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733255593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:16:10,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:16:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-10-15 15:16:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111767892] [2024-10-15 15:16:10,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:16:10,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 15:16:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 15:16:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:16:10,158 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 23 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 10 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-15 15:16:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:10,502 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-15 15:16:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 15:16:10,502 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 10 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-10-15 15:16:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:10,503 INFO L225 Difference]: With dead ends: 30 [2024-10-15 15:16:10,503 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:16:10,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2024-10-15 15:16:10,504 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:16:10,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 101 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:16:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:16:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:16:10,505 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-10-15 15:16:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:16:10,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-10-15 15:16:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:10,506 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:16:10,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 10 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-15 15:16:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:16:10,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:16:10,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:16:10,522 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:16:10,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:10,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-15 15:16:10,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:16:11,358 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:16:11,383 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_25_0 contained old-variable. Original clause: (let ((.cse8 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_25_0_#in~k.base|)) (.cse0 (select |#memory_int#3| |func_to_recursive_line_20_to_25_0_#in~i.base|)) (.cse1 (select |#memory_int#1| |func_to_recursive_line_20_to_25_0_#in~j.base|))) (let ((.cse2 (not (= |func_to_recursive_line_20_to_25_0_#in~k.offset| 0))) (.cse3 (not (= |func_to_recursive_line_20_to_25_0_#in~i.offset| 0))) (.cse4 (not (= |func_to_recursive_line_20_to_25_0_#in~j.offset| 0))) (.cse6 (select .cse1 0)) (.cse5 (select .cse0 0)) (.cse9 (select .cse8 |func_to_recursive_line_20_to_25_0_#in~k.offset|)) (.cse7 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_25_0_#in~j.base|)) (.cse10 (select (select |old(#memory_int#3)| |func_to_recursive_line_20_to_25_0_#in~i.base|) |func_to_recursive_line_20_to_25_0_#in~i.offset|))) (and (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_25_0_#in~k.base|) |func_to_recursive_line_20_to_25_0_#in~k.offset|) (+ (select .cse0 |func_to_recursive_line_20_to_25_0_#in~i.offset|) (select .cse1 |func_to_recursive_line_20_to_25_0_#in~j.offset|))) (or .cse2 .cse3 .cse4 (and (= .cse5 1) (= 2 .cse6)) (not (= (select .cse7 0) 2)) (not (= 3 (select .cse8 0)))) (or .cse2 .cse3 .cse4 (not (= .cse9 0)) (and (= .cse6 0) (= .cse5 0)) (not (= .cse10 0))) (= .cse9 (+ (select .cse7 |func_to_recursive_line_20_to_25_0_#in~j.offset|) .cse10))))) Eliminated clause: (let ((.cse1 (select |#memory_int#1| |func_to_recursive_line_20_to_25_0_#in~j.base|)) (.cse0 (select |#memory_int#3| |func_to_recursive_line_20_to_25_0_#in~i.base|))) (and (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_25_0_#in~k.base|) |func_to_recursive_line_20_to_25_0_#in~k.offset|) (+ (select .cse0 |func_to_recursive_line_20_to_25_0_#in~i.offset|) (select .cse1 |func_to_recursive_line_20_to_25_0_#in~j.offset|))) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_int#3)| (Array Int (Array Int Int))) (|old(#memory_int#2)| (Array Int (Array Int Int)))) (let ((.cse10 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_25_0_#in~k.base|))) (let ((.cse2 (not (= |func_to_recursive_line_20_to_25_0_#in~k.offset| 0))) (.cse3 (not (= |func_to_recursive_line_20_to_25_0_#in~i.offset| 0))) (.cse4 (not (= |func_to_recursive_line_20_to_25_0_#in~j.offset| 0))) (.cse8 (select .cse0 0)) (.cse7 (select .cse1 0)) (.cse5 (select .cse10 0)) (.cse9 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_25_0_#in~j.base|)) (.cse6 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_25_0_#in~i.base|))) (and (or .cse2 .cse3 .cse4 (not (= .cse5 0)) (not (= (select .cse6 0) 0)) (and (= .cse7 0) (= .cse8 0))) (or .cse2 .cse3 .cse4 (and (= .cse8 1) (= 2 .cse7)) (not (= (select .cse9 0) 2)) (not (= 3 .cse5))) (= (select .cse10 |func_to_recursive_line_20_to_25_0_#in~k.offset|) (+ (select .cse9 |func_to_recursive_line_20_to_25_0_#in~j.offset|) (select .cse6 |func_to_recursive_line_20_to_25_0_#in~i.offset|))))))))) [2024-10-15 15:16:11,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:16:11,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-15 15:16:11,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~k!base,]]] [2024-10-15 15:16:11,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-15 15:16:11,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-15 15:16:11,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~j!base,]]] [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 15:16:11,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~k!base,]]] [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~j!base,]]] [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-10-15 15:16:11,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-10-15 15:16:11,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:16:11 BoogieIcfgContainer [2024-10-15 15:16:11,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:16:11,389 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:16:11,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:16:11,389 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:16:11,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:16:07" (3/4) ... [2024-10-15 15:16:11,390 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:16:11,435 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:16:11,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:16:11,437 INFO L158 Benchmark]: Toolchain (without parser) took 4794.21ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 66.3MB in the beginning and 150.1MB in the end (delta: -83.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:16:11,437 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:16:11,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 138.4MB. Free memory was 66.1MB in the beginning and 54.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:16:11,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.77ms. Allocated memory is still 138.4MB. Free memory was 54.0MB in the beginning and 52.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:16:11,439 INFO L158 Benchmark]: Boogie Preprocessor took 35.92ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 52.9MB in the beginning and 149.0MB in the end (delta: -96.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-15 15:16:11,439 INFO L158 Benchmark]: RCFGBuilder took 315.96ms. Allocated memory is still 180.4MB. Free memory was 148.9MB in the beginning and 136.1MB in the end (delta: 12.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-15 15:16:11,440 INFO L158 Benchmark]: TraceAbstraction took 4181.79ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 135.9MB in the beginning and 153.2MB in the end (delta: -17.3MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2024-10-15 15:16:11,440 INFO L158 Benchmark]: Witness Printer took 46.25ms. Allocated memory is still 218.1MB. Free memory was 153.2MB in the beginning and 150.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:16:11,441 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.16ms. Allocated memory is still 138.4MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 138.4MB. Free memory was 66.1MB in the beginning and 54.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.77ms. Allocated memory is still 138.4MB. Free memory was 54.0MB in the beginning and 52.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.92ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 52.9MB in the beginning and 149.0MB in the end (delta: -96.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 315.96ms. Allocated memory is still 180.4MB. Free memory was 148.9MB in the beginning and 136.1MB in the end (delta: 12.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4181.79ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 135.9MB in the beginning and 153.2MB in the end (delta: -17.3MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 46.25ms. Allocated memory is still 218.1MB. Free memory was 153.2MB in the beginning and 150.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - 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[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~j!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~j!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!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: 26]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 27 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=1, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 71 ConstructedInterpolants, 4 QuantifiedInterpolants, 862 SizeOfPredicates, 28 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/15 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 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-10-15 15:16:11,465 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