./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fecc0272e3d3edda13fe6ca0a651d95cf8d16c414f426c1f8f27e509220a775 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:01:01,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:01:01,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:01:01,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:01:01,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:01:01,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:01:01,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:01:01,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:01:01,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:01:01,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:01:01,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:01:01,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:01:01,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:01:01,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:01:01,853 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:01:01,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:01:01,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:01:01,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:01:01,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:01:01,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:01:01,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:01:01,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:01:01,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:01:01,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:01:01,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:01:01,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:01:01,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:01:01,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:01:01,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:01:01,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:01:01,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:01:01,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:01:01,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:01:01,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:01:01,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:01:01,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:01:01,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:01:01,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:01:01,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:01:01,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:01:01,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:01:01,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:01:01,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/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 -> 5fecc0272e3d3edda13fe6ca0a651d95cf8d16c414f426c1f8f27e509220a775 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:01:02,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:01:02,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:01:02,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:01:02,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:01:02,076 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:01:02,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c [2024-09-11 20:01:03,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:01:03,605 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:01:03,605 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c [2024-09-11 20:01:03,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0f0d7bc08/b5159294cb8b42689db89ea8eee0b8e2/FLAGdf489cb9a [2024-09-11 20:01:04,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0f0d7bc08/b5159294cb8b42689db89ea8eee0b8e2 [2024-09-11 20:01:04,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:01:04,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:01:04,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:01:04,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:01:04,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:01:04,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f36471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04, skipping insertion in model container [2024-09-11 20:01:04,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:01:04,160 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c[546,559] [2024-09-11 20:01:04,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:01:04,187 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:01:04,197 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c[546,559] [2024-09-11 20:01:04,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:01:04,216 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:01:04,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04 WrapperNode [2024-09-11 20:01:04,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:01:04,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:01:04,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:01:04,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:01:04,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,242 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-09-11 20:01:04,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:01:04,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:01:04,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:01:04,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:01:04,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,258 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-11 20:01:04,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:01:04,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:01:04,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:01:04,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:01:04,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (1/1) ... [2024-09-11 20:01:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:01:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:04,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:01:04,329 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:01:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:01:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:01:04,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:01:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:01:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:01:04,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:01:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:01:04,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:01:04,466 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:01:04,468 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:01:04,548 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 20:01:04,548 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:01:04,564 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:01:04,564 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 20:01:04,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:01:04 BoogieIcfgContainer [2024-09-11 20:01:04,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:01:04,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:01:04,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:01:04,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:01:04,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:01:04" (1/3) ... [2024-09-11 20:01:04,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55411182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:01:04, skipping insertion in model container [2024-09-11 20:01:04,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:01:04" (2/3) ... [2024-09-11 20:01:04,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55411182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:01:04, skipping insertion in model container [2024-09-11 20:01:04,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:01:04" (3/3) ... [2024-09-11 20:01:04,571 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound5.c [2024-09-11 20:01:04,583 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:01:04,583 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:01:04,626 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:01:04,633 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;@2df63460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:01:04,634 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:01:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:01:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:01:04,642 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:04,643 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:04,643 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:04,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1373888804, now seen corresponding path program 1 times [2024-09-11 20:01:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306839526] [2024-09-11 20:01:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:04,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:01:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:04,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:01:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:04,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:01:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:04,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 20:01:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:01:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:04,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306839526] [2024-09-11 20:01:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306839526] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:01:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:01:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:01:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639088340] [2024-09-11 20:01:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:01:04,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:01:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:01:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:01:04,847 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:01:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:04,870 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2024-09-11 20:01:04,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:01:04,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-11 20:01:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:04,884 INFO L225 Difference]: With dead ends: 46 [2024-09-11 20:01:04,884 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 20:01:04,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:01:04,892 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:04,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:01:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 20:01:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-11 20:01:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:01:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-11 20:01:04,918 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2024-09-11 20:01:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:04,918 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-11 20:01:04,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:01:04,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-11 20:01:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:01:04,920 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:04,920 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:04,921 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:01:04,921 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:04,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -505565208, now seen corresponding path program 1 times [2024-09-11 20:01:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402244200] [2024-09-11 20:01:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:01:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5492207] [2024-09-11 20:01:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:04,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:04,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:04,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:01:04,966 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:01:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:01:05,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:01:05,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:01:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402244200] [2024-09-11 20:01:05,103 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:01:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5492207] [2024-09-11 20:01:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5492207] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:01:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:01:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:01:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269903014] [2024-09-11 20:01:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:01:05,105 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:01:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:01:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:01:05,106 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 20:01:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:05,147 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-09-11 20:01:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:01:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-11 20:01:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:05,149 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:01:05,149 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 20:01:05,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:01:05,151 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:05,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:01:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 20:01:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-09-11 20:01:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:01:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-11 20:01:05,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2024-09-11 20:01:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:05,163 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-11 20:01:05,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 20:01:05,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-11 20:01:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:01:05,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:05,164 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:05,179 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:01:05,368 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:05,369 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:05,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2051494664, now seen corresponding path program 1 times [2024-09-11 20:01:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195743259] [2024-09-11 20:01:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:01:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:01:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:01:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 20:01:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:01:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:01:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195743259] [2024-09-11 20:01:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195743259] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:01:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929000593] [2024-09-11 20:01:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:05,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:01:05,703 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:01:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:05,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:01:05,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:01:05,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:01:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929000593] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:01:05,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:01:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-09-11 20:01:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172777330] [2024-09-11 20:01:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:01:05,795 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:01:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:01:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:01:05,796 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:01:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:05,838 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-09-11 20:01:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:01:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-09-11 20:01:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:05,839 INFO L225 Difference]: With dead ends: 37 [2024-09-11 20:01:05,840 INFO L226 Difference]: Without dead ends: 29 [2024-09-11 20:01:05,841 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:01:05,843 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:05,843 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:01:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-11 20:01:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-11 20:01:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:01:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-11 20:01:05,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 35 [2024-09-11 20:01:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:05,851 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-11 20:01:05,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:01:05,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-11 20:01:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:01:05,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:05,853 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:05,865 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:01:06,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:06,059 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:06,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2099458174, now seen corresponding path program 1 times [2024-09-11 20:01:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819130451] [2024-09-11 20:01:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:01:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288208000] [2024-09-11 20:01:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:06,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:06,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:01:06,076 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:01:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:01:06,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:01:06,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:01:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:01:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819130451] [2024-09-11 20:01:06,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:01:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288208000] [2024-09-11 20:01:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288208000] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:01:06,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:01:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-09-11 20:01:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668583132] [2024-09-11 20:01:06,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:01:06,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:01:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:01:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:01:06,387 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:01:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:06,453 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-11 20:01:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:01:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-09-11 20:01:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:06,455 INFO L225 Difference]: With dead ends: 35 [2024-09-11 20:01:06,455 INFO L226 Difference]: Without dead ends: 31 [2024-09-11 20:01:06,455 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:01:06,456 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:06,456 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:01:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-11 20:01:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-11 20:01:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:01:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-11 20:01:06,461 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 35 [2024-09-11 20:01:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:06,465 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-11 20:01:06,465 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:01:06,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-11 20:01:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 20:01:06,466 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:06,467 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:06,478 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:01:06,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:06,671 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:06,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 197270962, now seen corresponding path program 1 times [2024-09-11 20:01:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55693295] [2024-09-11 20:01:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:01:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:01:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:01:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 20:01:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:01:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:01:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:01:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55693295] [2024-09-11 20:01:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55693295] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:01:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541279161] [2024-09-11 20:01:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:06,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:06,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:01:06,872 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:01:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:06,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 20:01:06,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:01:07,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:01:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:01:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541279161] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:01:07,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:01:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 14 [2024-09-11 20:01:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039830107] [2024-09-11 20:01:07,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:01:07,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:01:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:01:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:01:07,108 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 20:01:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:07,193 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-09-11 20:01:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:01:07,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 42 [2024-09-11 20:01:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:07,194 INFO L225 Difference]: With dead ends: 31 [2024-09-11 20:01:07,194 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:01:07,194 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:01:07,195 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:07,195 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:01:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:01:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:01:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:01:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:01:07,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-09-11 20:01:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:07,196 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:01:07,196 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 20:01:07,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:01:07,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:01:07,199 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:01:07,211 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:01:07,399 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:07,402 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-11 20:01:07,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:01:07,582 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:01:07,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:01:07 BoogieIcfgContainer [2024-09-11 20:01:07,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:01:07,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:01:07,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:01:07,594 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:01:07,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:01:04" (3/4) ... [2024-09-11 20:01:07,596 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:01:07,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 20:01:07,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:01:07,604 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:01:07,605 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:01:07,605 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:01:07,605 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:01:07,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:01:07,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:01:07,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:01:07,716 INFO L158 Benchmark]: Toolchain (without parser) took 3692.30ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 96.5MB in the beginning and 165.6MB in the end (delta: -69.0MB). Peak memory consumption was 1.0MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,717 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 120.0MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:01:07,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.51ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 85.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,717 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 82.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:01:07,717 INFO L158 Benchmark]: RCFGBuilder took 296.97ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 81.8MB in the beginning and 198.7MB in the end (delta: -117.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,718 INFO L158 Benchmark]: TraceAbstraction took 3027.94ms. Allocated memory is still 234.9MB. Free memory was 197.7MB in the beginning and 169.8MB in the end (delta: 27.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,718 INFO L158 Benchmark]: Witness Printer took 121.82ms. Allocated memory is still 234.9MB. Free memory was 169.8MB in the beginning and 165.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:01:07,719 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.10ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 120.0MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.51ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 85.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 82.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 296.97ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 81.8MB in the beginning and 198.7MB in the end (delta: -117.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3027.94ms. Allocated memory is still 234.9MB. Free memory was 197.7MB in the beginning and 169.8MB in the end (delta: 27.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Witness Printer took 121.82ms. Allocated memory is still 234.9MB. Free memory was 169.8MB in the beginning and 165.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 18]: 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 98 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 6 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 252/261 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: 50]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((x + y) == (((__int128) x * z) + 1)) && (1 <= c)) && (1 <= k)) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:01:07,739 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE