./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.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-simple/recursified_nested_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 34a8492e255374aad098e162859199083b5b90fe0eb733edf5e3563474d7ceaa --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:32:04,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:32:04,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:32:04,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:32:04,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:32:04,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:32:04,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:32:04,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:32:04,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:32:04,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:32:04,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:32:04,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:32:04,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:32:04,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:32:04,640 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:32:04,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:32:04,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:32:04,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:32:04,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:32:04,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:32:04,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:32:04,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:32:04,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:32:04,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:32:04,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:32:04,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:32:04,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:32:04,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:32:04,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:32:04,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:32:04,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:32:04,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:32:04,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:32:04,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:32:04,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:32:04,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:32:04,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:32:04,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:32:04,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:32:04,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:32:04,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:32:04,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:32:04,647 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 -> 34a8492e255374aad098e162859199083b5b90fe0eb733edf5e3563474d7ceaa 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:32:04,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:32:04,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:32:04,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:32:04,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:32:04,878 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:32:04,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.c [2024-09-11 20:32:06,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:32:06,325 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:32:06,325 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.c [2024-09-11 20:32:06,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0940b494c/287540263b514303b6f49937e769383a/FLAG6bedc5ebc [2024-09-11 20:32:06,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0940b494c/287540263b514303b6f49937e769383a [2024-09-11 20:32:06,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:32:06,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:32:06,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:32:06,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:32:06,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:32:06,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b566f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06, skipping insertion in model container [2024-09-11 20:32:06,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:32:06,879 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-simple/recursified_nested_1.c[1277,1290] [2024-09-11 20:32:06,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:32:06,889 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:32:06,906 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-simple/recursified_nested_1.c[1277,1290] [2024-09-11 20:32:06,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:32:06,933 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:32:06,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06 WrapperNode [2024-09-11 20:32:06,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:32:06,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:32:06,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:32:06,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:32:06,942 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:32:06" (1/1) ... [2024-09-11 20:32:06,946 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:32:06" (1/1) ... [2024-09-11 20:32:06,959 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-09-11 20:32:06,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:32:06,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:32:06,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:32:06,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:32:06,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,996 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-09-11 20:32:06,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:32:07,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:32:07,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:32:07,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:32:07,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:32:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:07,031 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:32:07,033 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:32:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 20:32:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2024-09-11 20:32:07,065 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:32:07,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:32:07,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:32:07,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 20:32:07,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 20:32:07,115 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:32:07,116 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:32:07,187 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-11 20:32:07,187 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:32:07,205 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:32:07,205 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:32:07,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07 BoogieIcfgContainer [2024-09-11 20:32:07,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:32:07,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:32:07,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:32:07,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:32:07,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:32:06" (1/3) ... [2024-09-11 20:32:07,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435adadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:32:07, skipping insertion in model container [2024-09-11 20:32:07,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (2/3) ... [2024-09-11 20:32:07,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435adadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:32:07, skipping insertion in model container [2024-09-11 20:32:07,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07" (3/3) ... [2024-09-11 20:32:07,212 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_1.c [2024-09-11 20:32:07,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:32:07,223 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:32:07,258 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:32:07,262 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;@f8cd4ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:32:07,262 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:32:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 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:32:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 20:32:07,275 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:07,275 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:07,276 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:07,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1146450700, now seen corresponding path program 1 times [2024-09-11 20:32:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420778544] [2024-09-11 20:32:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,661 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:32:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420778544] [2024-09-11 20:32:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420778544] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:32:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:32:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:32:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220813318] [2024-09-11 20:32:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:32:07,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:32:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:32:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:32:07,683 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 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 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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:32:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:07,754 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-09-11 20:32:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:32:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-09-11 20:32:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:07,768 INFO L225 Difference]: With dead ends: 21 [2024-09-11 20:32:07,769 INFO L226 Difference]: Without dead ends: 13 [2024-09-11 20:32:07,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:32:07,775 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:07,779 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:32:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-11 20:32:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-11 20:32:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 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:32:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-09-11 20:32:07,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2024-09-11 20:32:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:07,806 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-09-11 20:32:07,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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:32:07,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-09-11 20:32:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 20:32:07,809 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:07,809 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:07,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:32:07,810 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:07,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1151650808, now seen corresponding path program 1 times [2024-09-11 20:32:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763695833] [2024-09-11 20:32:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,244 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:32:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763695833] [2024-09-11 20:32:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763695833] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553669631] [2024-09-11 20:32:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:08,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:08,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:08,250 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:32:08,255 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:32:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:32:08,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:08,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:08,507 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:32:08,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:08,829 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:32:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553669631] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:08,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2024-09-11 20:32:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024235052] [2024-09-11 20:32:08,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:08,833 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:32:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:08,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:32:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:32:08,837 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:32:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:08,990 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-11 20:32:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:32:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 14 [2024-09-11 20:32:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:08,994 INFO L225 Difference]: With dead ends: 21 [2024-09-11 20:32:08,994 INFO L226 Difference]: Without dead ends: 17 [2024-09-11 20:32:08,995 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:32:08,995 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:08,996 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-11 20:32:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-11 20:32:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:32:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-11 20:32:09,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2024-09-11 20:32:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:09,004 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-11 20:32:09,004 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:32:09,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-11 20:32:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:32:09,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:09,005 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:09,019 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:32:09,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:09,210 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:09,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1489619010, now seen corresponding path program 2 times [2024-09-11 20:32:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:09,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062660015] [2024-09-11 20:32:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:32:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062660015] [2024-09-11 20:32:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062660015] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946881227] [2024-09-11 20:32:09,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:32:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:09,740 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:32:09,744 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:32:09,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:32:09,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:09,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-11 20:32:09,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:09,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:09,996 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 25 treesize of output 13 [2024-09-11 20:32:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:32:09,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:10,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-11 20:32:22,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946881227] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:22,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:32:22,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-09-11 20:32:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166794731] [2024-09-11 20:32:22,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:22,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:32:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:32:22,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=595, Unknown=3, NotChecked=0, Total=702 [2024-09-11 20:32:22,718 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:32:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:22,883 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-11 20:32:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:32:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 24 [2024-09-11 20:32:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:22,884 INFO L225 Difference]: With dead ends: 25 [2024-09-11 20:32:22,885 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:32:22,885 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=167, Invalid=886, Unknown=3, NotChecked=0, Total=1056 [2024-09-11 20:32:22,886 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:22,886 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:32:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:32:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-11 20:32:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-11 20:32:22,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 24 [2024-09-11 20:32:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:22,891 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-11 20:32:22,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:32:22,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-11 20:32:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-11 20:32:22,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:22,892 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:22,905 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 20:32:23,093 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:23,094 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1362462852, now seen corresponding path program 3 times [2024-09-11 20:32:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689906950] [2024-09-11 20:32:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:32:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689906950] [2024-09-11 20:32:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689906950] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001046198] [2024-09-11 20:32:23,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:32:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:23,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:32:23,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-11 20:32:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:23,930 WARN L260 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-09-11 20:32:23,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:23,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-11 20:32:24,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:32:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001046198] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:25,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 25] total 42 [2024-09-11 20:32:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624324847] [2024-09-11 20:32:25,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:25,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-11 20:32:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-11 20:32:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1480, Unknown=0, NotChecked=0, Total=1806 [2024-09-11 20:32:25,726 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 43 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-09-11 20:32:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:25,969 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-09-11 20:32:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:32:25,969 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 34 [2024-09-11 20:32:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:25,970 INFO L225 Difference]: With dead ends: 27 [2024-09-11 20:32:25,970 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 20:32:25,971 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=476, Invalid=2074, Unknown=0, NotChecked=0, Total=2550 [2024-09-11 20:32:25,972 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:25,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 20:32:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 20:32:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 20:32:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-09-11 20:32:25,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 34 [2024-09-11 20:32:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:25,977 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-09-11 20:32:25,977 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-09-11 20:32:25,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-09-11 20:32:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 20:32:25,978 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:25,978 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:25,993 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:32:26,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:26,183 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:26,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2002779038, now seen corresponding path program 4 times [2024-09-11 20:32:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494883349] [2024-09-11 20:32:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-11 20:32:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494883349] [2024-09-11 20:32:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494883349] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640806584] [2024-09-11 20:32:26,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:32:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:26,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:26,958 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:32:27,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:32:27,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:27,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-09-11 20:32:27,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:27,068 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 25 treesize of output 13 [2024-09-11 20:32:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-09-11 20:32:27,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:27,915 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:27,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-11 20:32:28,251 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:28,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-11 20:32:28,520 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:28,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-11 20:32:28,689 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-11 20:32:28,791 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-11 20:32:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-09-11 20:32:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640806584] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:28,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 23 [2024-09-11 20:32:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158265642] [2024-09-11 20:32:28,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:28,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:32:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:32:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:32:28,998 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-11 20:32:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:29,164 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-09-11 20:32:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:32:29,164 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 6 states have call successors, (7) Word has length 39 [2024-09-11 20:32:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:29,165 INFO L225 Difference]: With dead ends: 23 [2024-09-11 20:32:29,165 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:32:29,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:32:29,166 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:29,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:32:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:32:29,167 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:32:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:32:29,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-09-11 20:32:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:29,167 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:32:29,167 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-11 20:32:29,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:32:29,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:32:29,169 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:32:29,188 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:32:29,370 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:29,373 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1] [2024-09-11 20:32:29,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:32:29,593 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:32:29,603 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 20:32:29,603 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-11 20:32:29,604 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 20:32:29,604 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-11 20:32:29,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:32:29 BoogieIcfgContainer [2024-09-11 20:32:29,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:32:29,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:32:29,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:32:29,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:32:29,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07" (3/4) ... [2024-09-11 20:32:29,607 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:32:29,610 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_19_to_19_0 [2024-09-11 20:32:29,613 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:32:29,613 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:32:29,613 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:32:29,613 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:32:29,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:32:29,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:32:29,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:32:29,672 INFO L158 Benchmark]: Toolchain (without parser) took 22938.06ms. Allocated memory was 180.4MB in the beginning and 230.7MB in the end (delta: 50.3MB). Free memory was 110.4MB in the beginning and 135.7MB in the end (delta: -25.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,672 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:32:29,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.93ms. Allocated memory is still 180.4MB. Free memory was 110.2MB in the beginning and 152.4MB in the end (delta: -42.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.31ms. Allocated memory is still 180.4MB. Free memory was 152.4MB in the beginning and 150.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,674 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 180.4MB. Free memory was 150.7MB in the beginning and 149.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,674 INFO L158 Benchmark]: RCFGBuilder took 199.68ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 137.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,674 INFO L158 Benchmark]: TraceAbstraction took 22397.94ms. Allocated memory was 180.4MB in the beginning and 230.7MB in the end (delta: 50.3MB). Free memory was 137.2MB in the beginning and 139.9MB in the end (delta: -2.7MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,675 INFO L158 Benchmark]: Witness Printer took 65.89ms. Allocated memory is still 230.7MB. Free memory was 139.9MB in the beginning and 135.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:32:29,677 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.15ms. Allocated memory is still 121.6MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.93ms. Allocated memory is still 180.4MB. Free memory was 110.2MB in the beginning and 152.4MB in the end (delta: -42.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.31ms. Allocated memory is still 180.4MB. Free memory was 152.4MB in the beginning and 150.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 180.4MB. Free memory was 150.7MB in the beginning and 149.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 199.68ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 137.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22397.94ms. Allocated memory was 180.4MB in the beginning and 230.7MB in the end (delta: 50.3MB). Free memory was 137.2MB in the beginning and 139.9MB in the end (delta: -2.7MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 65.89ms. Allocated memory is still 230.7MB. Free memory was 139.9MB in the beginning and 135.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - 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~a!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: 48]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 338 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 536 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 42 mSDtfsCounter, 536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 49, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 231 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 306 ConstructedInterpolants, 4 QuantifiedInterpolants, 2925 SizeOfPredicates, 46 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 319/573 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 - InvariantResult [Line: 46]: Location Invariant Derived location invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-09-11 20:32:29,695 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE