./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex3.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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/loop-lit/bh2017-ex3.i -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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:23:25,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:23:25,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:23:25,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:23:25,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:23:25,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:23:25,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:23:25,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:23:25,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:23:25,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:23:25,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:23:25,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:23:25,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:23:25,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:23:25,652 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:23:25,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:23:25,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:23:25,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:23:25,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:23:25,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:23:25,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:23:25,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:23:25,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:23:25,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:23:25,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:23:25,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:23:25,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:23:25,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:23:25,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:23:25,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:23:25,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:23:25,670 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-09-25 10:23:25,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:23:25,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:23:25,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:23:25,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:23:25,923 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:23:25,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-09-25 10:23:27,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:23:27,326 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:23:27,328 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-09-25 10:23:27,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0cdce531c/917d08f5aa124d09bb9e6a3afc018ca9/FLAGf79346e0f [2024-09-25 10:23:27,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0cdce531c/917d08f5aa124d09bb9e6a3afc018ca9 [2024-09-25 10:23:27,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:23:27,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:23:27,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:23:27,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:23:27,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:23:27,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bfd525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27, skipping insertion in model container [2024-09-25 10:23:27,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:23:27,506 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/loop-lit/bh2017-ex3.i[799,812] [2024-09-25 10:23:27,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:23:27,533 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:23:27,541 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/loop-lit/bh2017-ex3.i[799,812] [2024-09-25 10:23:27,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:23:27,560 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:23:27,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27 WrapperNode [2024-09-25 10:23:27,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:23:27,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:23:27,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:23:27,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:23:27,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,577 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:23:27,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:23:27,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:23:27,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:23:27,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:23:27,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,599 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:23:27,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:23:27,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:23:27,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:23:27,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:23:27,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (1/1) ... [2024-09-25 10:23:27,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:23:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:27,640 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-25 10:23:27,642 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-25 10:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:23:27,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:23:27,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:23:27,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:23:27,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:23:27,729 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:23:27,730 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:23:27,855 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-25 10:23:27,856 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:23:27,876 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:23:27,877 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:23:27,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:27 BoogieIcfgContainer [2024-09-25 10:23:27,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:23:27,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:23:27,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:23:27,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:23:27,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:23:27" (1/3) ... [2024-09-25 10:23:27,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:23:27, skipping insertion in model container [2024-09-25 10:23:27,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:27" (2/3) ... [2024-09-25 10:23:27,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:23:27, skipping insertion in model container [2024-09-25 10:23:27,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:27" (3/3) ... [2024-09-25 10:23:27,885 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2024-09-25 10:23:27,898 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:23:27,898 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:23:27,948 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:23:27,952 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;@6a436f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:23:27,953 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:23:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:23:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:23:27,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:27,964 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:27,964 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:27,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 680007434, now seen corresponding path program 1 times [2024-09-25 10:23:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732147231] [2024-09-25 10:23:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,188 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-25 10:23:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732147231] [2024-09-25 10:23:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732147231] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:28,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:23:28,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484821399] [2024-09-25 10:23:28,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:28,194 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:23:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:23:28,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:23:28,216 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:23:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:28,297 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-09-25 10:23:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:23:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:23:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:28,305 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:23:28,306 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 10:23:28,309 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:28,312 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:28,313 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 10:23:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-25 10:23:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:23:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-25 10:23:28,348 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 10 [2024-09-25 10:23:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:28,349 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-25 10:23:28,349 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:23:28,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-25 10:23:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:23:28,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:28,351 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:28,351 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:23:28,352 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:28,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1377748879, now seen corresponding path program 1 times [2024-09-25 10:23:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845397113] [2024-09-25 10:23:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:23:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845397113] [2024-09-25 10:23:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845397113] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:23:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376264163] [2024-09-25 10:23:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:28,457 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:23:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:28,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:23:28,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:23:28,458 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:23:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:28,503 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-09-25 10:23:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:23:28,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-25 10:23:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:28,505 INFO L225 Difference]: With dead ends: 34 [2024-09-25 10:23:28,505 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:23:28,505 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:28,507 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:28,507 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:23:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 10:23:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:23:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-09-25 10:23:28,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2024-09-25 10:23:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:28,521 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-09-25 10:23:28,521 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:23:28,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-09-25 10:23:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:23:28,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:28,522 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:28,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:23:28,525 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:28,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1982048434, now seen corresponding path program 1 times [2024-09-25 10:23:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179491781] [2024-09-25 10:23:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:23:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179491781] [2024-09-25 10:23:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179491781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:23:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679213290] [2024-09-25 10:23:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:28,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:23:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:23:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:28,606 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:28,631 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2024-09-25 10:23:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:23:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-25 10:23:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:28,633 INFO L225 Difference]: With dead ends: 70 [2024-09-25 10:23:28,633 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 10:23:28,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:28,634 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:28,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 10:23:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-25 10:23:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:23:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2024-09-25 10:23:28,653 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 24 [2024-09-25 10:23:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:28,653 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2024-09-25 10:23:28,655 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:28,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2024-09-25 10:23:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:23:28,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:28,656 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:28,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:23:28,657 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:28,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash -524859520, now seen corresponding path program 1 times [2024-09-25 10:23:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230857491] [2024-09-25 10:23:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:23:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230857491] [2024-09-25 10:23:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230857491] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:23:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669869590] [2024-09-25 10:23:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:28,722 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:23:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:23:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:28,723 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:28,743 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2024-09-25 10:23:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:23:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-25 10:23:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:28,745 INFO L225 Difference]: With dead ends: 101 [2024-09-25 10:23:28,745 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 10:23:28,746 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:28,747 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:28,747 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 10:23:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-25 10:23:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 10:23:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-09-25 10:23:28,756 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 24 [2024-09-25 10:23:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:28,757 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-09-25 10:23:28,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:28,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-09-25 10:23:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 10:23:28,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:28,758 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:28,758 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:23:28,759 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:28,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1160279032, now seen corresponding path program 1 times [2024-09-25 10:23:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160276814] [2024-09-25 10:23:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:23:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:23:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160276814] [2024-09-25 10:23:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160276814] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:23:28,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960396793] [2024-09-25 10:23:28,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:28,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:28,864 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-25 10:23:28,865 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-25 10:23:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:28,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:23:28,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:23:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:28,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:23:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960396793] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:23:29,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:23:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:23:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796626473] [2024-09-25 10:23:29,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:23:29,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:23:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:23:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:29,025 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:29,082 INFO L93 Difference]: Finished difference Result 181 states and 273 transitions. [2024-09-25 10:23:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 39 [2024-09-25 10:23:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:29,084 INFO L225 Difference]: With dead ends: 181 [2024-09-25 10:23:29,085 INFO L226 Difference]: Without dead ends: 123 [2024-09-25 10:23:29,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:29,086 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:29,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-25 10:23:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-09-25 10:23:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 29 states have call successors, (29), 5 states have call predecessors, (29), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-25 10:23:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2024-09-25 10:23:29,104 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 39 [2024-09-25 10:23:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:29,105 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2024-09-25 10:23:29,105 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:29,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2024-09-25 10:23:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 10:23:29,106 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:29,106 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:29,120 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:23:29,310 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:29,311 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:29,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -780954938, now seen corresponding path program 1 times [2024-09-25 10:23:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:29,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162535796] [2024-09-25 10:23:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:23:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:23:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162535796] [2024-09-25 10:23:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162535796] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:23:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456467921] [2024-09-25 10:23:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:29,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:29,405 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-25 10:23:29,406 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-25 10:23:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:23:29,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:23:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:29,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:23:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456467921] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:23:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:23:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:23:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758343401] [2024-09-25 10:23:29,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:23:29,523 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:23:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:23:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:29,525 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:29,590 INFO L93 Difference]: Finished difference Result 382 states and 600 transitions. [2024-09-25 10:23:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 39 [2024-09-25 10:23:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:29,593 INFO L225 Difference]: With dead ends: 382 [2024-09-25 10:23:29,593 INFO L226 Difference]: Without dead ends: 264 [2024-09-25 10:23:29,597 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:29,597 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:29,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 116 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-25 10:23:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-09-25 10:23:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 62 states have call successors, (62), 5 states have call predecessors, (62), 4 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-09-25 10:23:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 406 transitions. [2024-09-25 10:23:29,645 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 406 transitions. Word has length 39 [2024-09-25 10:23:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:29,646 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 406 transitions. [2024-09-25 10:23:29,646 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:29,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 406 transitions. [2024-09-25 10:23:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-25 10:23:29,651 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:29,651 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:29,666 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:23:29,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:23:29,856 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:29,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2069607630, now seen corresponding path program 2 times [2024-09-25 10:23:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:29,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148938638] [2024-09-25 10:23:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:29,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:23:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:23:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:23:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:23:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 10:23:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 10:23:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-25 10:23:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-25 10:23:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-09-25 10:23:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148938638] [2024-09-25 10:23:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148938638] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:30,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:23:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117937606] [2024-09-25 10:23:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:30,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:23:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:23:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:30,021 INFO L87 Difference]: Start difference. First operand 264 states and 406 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:30,075 INFO L93 Difference]: Finished difference Result 270 states and 411 transitions. [2024-09-25 10:23:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:30,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2024-09-25 10:23:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:30,077 INFO L225 Difference]: With dead ends: 270 [2024-09-25 10:23:30,077 INFO L226 Difference]: Without dead ends: 268 [2024-09-25 10:23:30,077 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:30,078 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:30,078 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-09-25 10:23:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-09-25 10:23:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 200 states have (on average 1.43) internal successors, (286), 200 states have internal predecessors, (286), 62 states have call successors, (62), 6 states have call predecessors, (62), 5 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-09-25 10:23:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2024-09-25 10:23:30,119 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 84 [2024-09-25 10:23:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:30,121 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2024-09-25 10:23:30,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:30,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2024-09-25 10:23:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-25 10:23:30,126 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:30,126 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:30,126 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:23:30,126 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:30,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:30,127 INFO L85 PathProgramCache]: Analyzing trace with hash -216355328, now seen corresponding path program 2 times [2024-09-25 10:23:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969767768] [2024-09-25 10:23:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:23:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:23:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:23:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:23:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 10:23:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 10:23:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-25 10:23:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-25 10:23:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-09-25 10:23:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969767768] [2024-09-25 10:23:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969767768] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:23:30,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11452569] [2024-09-25 10:23:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:30,262 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:23:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:23:30,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:30,263 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:30,318 INFO L93 Difference]: Finished difference Result 268 states and 409 transitions. [2024-09-25 10:23:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2024-09-25 10:23:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:30,320 INFO L225 Difference]: With dead ends: 268 [2024-09-25 10:23:30,321 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:23:30,322 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:30,323 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:30,323 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 92 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:23:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:23:30,324 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-25 10:23:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:23:30,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-09-25 10:23:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:30,325 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:23:30,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:30,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:23:30,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:23:30,328 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:23:30,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:23:30,330 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-09-25 10:23:30,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:23:31,132 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:23:31,145 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:23:31,145 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:23:31,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:23:31,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:23:31 BoogieIcfgContainer [2024-09-25 10:23:31,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:23:31,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:23:31,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:23:31,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:23:31,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:27" (3/4) ... [2024-09-25 10:23:31,149 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:23:31,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:23:31,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:23:31,190 INFO L158 Benchmark]: Toolchain (without parser) took 3836.15ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 28.4MB in the beginning and 47.7MB in the end (delta: -19.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,190 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:23:31,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 69.2MB. Free memory was 28.2MB in the beginning and 38.8MB in the end (delta: -10.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.21ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 37.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:23:31,190 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 36.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,191 INFO L158 Benchmark]: RCFGBuilder took 266.41ms. Allocated memory is still 69.2MB. Free memory was 36.0MB in the beginning and 45.6MB in the end (delta: -9.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,191 INFO L158 Benchmark]: TraceAbstraction took 3266.85ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 45.0MB in the beginning and 50.8MB in the end (delta: -5.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,191 INFO L158 Benchmark]: Witness Printer took 42.25ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 47.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 10:23:31,192 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 69.2MB. Free memory was 28.2MB in the beginning and 38.8MB in the end (delta: -10.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.21ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 37.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 36.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.41ms. Allocated memory is still 69.2MB. Free memory was 36.0MB in the beginning and 45.6MB in the end (delta: -9.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3266.85ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 45.0MB in the beginning and 50.8MB in the end (delta: -5.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 42.25ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 47.7MB in the end (delta: 3.1MB). 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: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 13]: 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 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 689 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 226 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 750/792 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: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main. Ensures: 0 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:23:31,219 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