./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/recHanoi03-2.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/recursive/recHanoi03-2.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 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --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:25:30,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:25:30,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:25:30,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:25:30,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:25:30,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:25:30,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:25:30,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:25:30,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:25:30,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:25:30,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:25:30,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:25:30,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:25:30,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:25:30,164 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:25:30,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:25:30,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:25:30,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:25:30,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:25:30,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:25:30,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:25:30,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:25:30,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:25:30,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:25:30,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:25:30,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:25:30,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:25:30,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:25:30,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:25:30,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:25:30,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:25:30,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:25:30,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:30,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:25:30,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:25:30,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:25:30,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:25:30,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:25:30,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:25:30,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:25:30,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:25:30,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:25:30,174 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 -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 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:25:30,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:25:30,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:25:30,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:25:30,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:25:30,416 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:25:30,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/recHanoi03-2.c [2024-09-11 20:25:31,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:25:31,843 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:25:31,844 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-09-11 20:25:31,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/cd63d40f6/1619b7b360254ca3a93de530e550ac7d/FLAG3e9a6a4cd [2024-09-11 20:25:31,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/cd63d40f6/1619b7b360254ca3a93de530e550ac7d [2024-09-11 20:25:31,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:25:31,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:25:31,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:31,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:25:31,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:25:31,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:31" (1/1) ... [2024-09-11 20:25:31,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13168833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:31, skipping insertion in model container [2024-09-11 20:25:31,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:31" (1/1) ... [2024-09-11 20:25:31,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:25:32,027 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/recursive/recHanoi03-2.c[769,782] [2024-09-11 20:25:32,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:32,064 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:25:32,074 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/recursive/recHanoi03-2.c[769,782] [2024-09-11 20:25:32,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:32,085 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:25:32,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32 WrapperNode [2024-09-11 20:25:32,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:32,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:32,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:25:32,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:25:32,091 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:25:32" (1/1) ... [2024-09-11 20:25:32,094 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:25:32" (1/1) ... [2024-09-11 20:25:32,104 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-09-11 20:25:32,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:32,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:25:32,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:25:32,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:25:32,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,118 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:25:32,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:25:32,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:25:32,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:25:32,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:25:32,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (1/1) ... [2024-09-11 20:25:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:32,148 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:25:32,149 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:25:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:25:32,178 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-09-11 20:25:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-09-11 20:25:32,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:25:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:25:32,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:25:32,221 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:25:32,222 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:25:32,322 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 20:25:32,323 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:25:32,350 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:25:32,350 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:25:32,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:32 BoogieIcfgContainer [2024-09-11 20:25:32,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:25:32,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:25:32,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:25:32,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:25:32,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:25:31" (1/3) ... [2024-09-11 20:25:32,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773999ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:32, skipping insertion in model container [2024-09-11 20:25:32,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:32" (2/3) ... [2024-09-11 20:25:32,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773999ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:32, skipping insertion in model container [2024-09-11 20:25:32,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:32" (3/3) ... [2024-09-11 20:25:32,356 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2024-09-11 20:25:32,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:25:32,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:25:32,411 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:25:32,415 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;@6e052b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:25:32,416 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:25:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:25:32,423 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:32,423 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:32,423 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:32,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859687, now seen corresponding path program 1 times [2024-09-11 20:25:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156149386] [2024-09-11 20:25:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:25:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156149386] [2024-09-11 20:25:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156149386] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133795285] [2024-09-11 20:25:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:32,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:32,700 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:32,791 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-09-11 20:25:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-11 20:25:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:32,798 INFO L225 Difference]: With dead ends: 23 [2024-09-11 20:25:32,798 INFO L226 Difference]: Without dead ends: 15 [2024-09-11 20:25:32,801 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:32,804 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:32,805 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-11 20:25:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-11 20:25:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:25:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-09-11 20:25:32,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-09-11 20:25:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:32,829 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-09-11 20:25:32,830 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:32,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-09-11 20:25:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-11 20:25:32,833 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:32,833 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:32,833 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:25:32,834 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:32,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -797183849, now seen corresponding path program 1 times [2024-09-11 20:25:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:32,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682531174] [2024-09-11 20:25:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:33,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682531174] [2024-09-11 20:25:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682531174] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107431728] [2024-09-11 20:25:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:33,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:33,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:33,113 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:25:33,115 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:25:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:33,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:25:33,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:25:33,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107431728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:33,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:33,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-09-11 20:25:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181621373] [2024-09-11 20:25:33,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:33,621 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:25:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:25:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:25:33,622 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:25:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:33,726 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-09-11 20:25:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:25:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 16 [2024-09-11 20:25:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:33,727 INFO L225 Difference]: With dead ends: 27 [2024-09-11 20:25:33,727 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:25:33,728 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:25:33,729 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:33,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:25:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:25:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:25:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-11 20:25:33,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-11 20:25:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:33,733 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-11 20:25:33,734 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:25:33,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-11 20:25:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:25:33,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:33,735 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:33,747 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:25:33,939 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:25:33,940 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:33,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1671831511, now seen corresponding path program 2 times [2024-09-11 20:25:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:33,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017861538] [2024-09-11 20:25:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:33,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:34,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:34,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:34,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:34,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:25:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017861538] [2024-09-11 20:25:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017861538] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191556588] [2024-09-11 20:25:34,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:34,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:34,281 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:25:34,282 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:25:34,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:34,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:34,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 20:25:34,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:34,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191556588] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:35,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 31 [2024-09-11 20:25:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999096638] [2024-09-11 20:25:35,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:35,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-11 20:25:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-11 20:25:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-09-11 20:25:35,434 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-09-11 20:25:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:35,681 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-09-11 20:25:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:25:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 28 [2024-09-11 20:25:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:35,682 INFO L225 Difference]: With dead ends: 36 [2024-09-11 20:25:35,683 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 20:25:35,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:25:35,684 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:35,684 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 100 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 20:25:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-11 20:25:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 20:25:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-09-11 20:25:35,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2024-09-11 20:25:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:35,692 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-09-11 20:25:35,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-09-11 20:25:35,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-09-11 20:25:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-11 20:25:35,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:35,694 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:35,709 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:25:35,898 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:25:35,900 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:35,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1245455975, now seen corresponding path program 3 times [2024-09-11 20:25:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807077367] [2024-09-11 20:25:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-11 20:25:36,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:36,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807077367] [2024-09-11 20:25:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807077367] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563667355] [2024-09-11 20:25:36,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:25:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:36,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:36,474 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:25:36,475 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:25:36,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-11 20:25:36,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:36,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:25:36,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-11 20:25:36,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-11 20:25:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563667355] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:39,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 46 [2024-09-11 20:25:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594308890] [2024-09-11 20:25:39,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:39,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-11 20:25:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-11 20:25:39,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2024-09-11 20:25:39,941 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-09-11 20:25:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:40,447 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-09-11 20:25:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-11 20:25:40,448 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) Word has length 46 [2024-09-11 20:25:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:40,451 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:25:40,451 INFO L226 Difference]: Without dead ends: 48 [2024-09-11 20:25:40,452 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=3925, Unknown=0, NotChecked=0, Total=4556 [2024-09-11 20:25:40,453 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:40,453 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 263 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-11 20:25:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-11 20:25:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-09-11 20:25:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-09-11 20:25:40,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2024-09-11 20:25:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:40,461 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-09-11 20:25:40,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-09-11 20:25:40,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-09-11 20:25:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-11 20:25:40,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:40,463 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:40,479 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:25:40,665 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:25:40,665 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:40,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -828786649, now seen corresponding path program 4 times [2024-09-11 20:25:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462075609] [2024-09-11 20:25:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:40,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:42,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:42,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-09-11 20:25:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462075609] [2024-09-11 20:25:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462075609] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801542007] [2024-09-11 20:25:42,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:25:42,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:42,171 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:25:42,172 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:25:42,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:25:42,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:42,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-11 20:25:42,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-09-11 20:25:43,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:26:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-09-11 20:26:01,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801542007] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:26:01,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:26:01,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 42] total 76 [2024-09-11 20:26:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300024734] [2024-09-11 20:26:01,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:26:01,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-09-11 20:26:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:26:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-09-11 20:26:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2024-09-11 20:26:01,638 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-09-11 20:26:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:26:03,042 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-09-11 20:26:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-11 20:26:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) Word has length 82 [2024-09-11 20:26:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:26:03,044 INFO L225 Difference]: With dead ends: 90 [2024-09-11 20:26:03,044 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:26:03,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1873, Invalid=12889, Unknown=0, NotChecked=0, Total=14762 [2024-09-11 20:26:03,047 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 144 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:26:03,047 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 562 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:26:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:26:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-11 20:26:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2024-09-11 20:26:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-09-11 20:26:03,059 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2024-09-11 20:26:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:26:03,059 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-09-11 20:26:03,060 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-09-11 20:26:03,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:26:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-09-11 20:26:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-09-11 20:26:03,063 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:26:03,063 INFO L216 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:26:03,076 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:26:03,267 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:26:03,267 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:26:03,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:26:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash 479378343, now seen corresponding path program 5 times [2024-09-11 20:26:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:26:03,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420529616] [2024-09-11 20:26:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:26:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:26:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:03,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:04,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:04,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:04,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:05,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:05,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:05,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:05,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:06,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:06,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:06,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:06,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:07,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:26:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:26:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-09-11 20:26:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:26:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420529616] [2024-09-11 20:26:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420529616] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:26:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289299177] [2024-09-11 20:26:08,756 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:26:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:26:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:26:08,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:26:08,758 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:26:09,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2024-09-11 20:26:09,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:26:09,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-11 20:26:09,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:26:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-09-11 20:26:11,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:26:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289299177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:26:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:26:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [55] total 107 [2024-09-11 20:26:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583198206] [2024-09-11 20:26:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:26:11,594 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-11 20:26:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:26:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-11 20:26:11,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-09-11 20:26:11,600 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-09-11 20:26:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:26:11,770 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-09-11 20:26:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-11 20:26:11,771 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) Word has length 154 [2024-09-11 20:26:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:26:11,772 INFO L225 Difference]: With dead ends: 84 [2024-09-11 20:26:11,772 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:26:11,775 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-09-11 20:26:11,775 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:26:11,776 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:26:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:26:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:26:11,776 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:26:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:26:11,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2024-09-11 20:26:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:26:11,776 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:26:11,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-09-11 20:26:11,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:26:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:26:11,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:26:11,779 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:26:11,800 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:26:11,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:26:11,987 INFO L408 BasicCegarLoop]: Path program histogram: [5, 1] [2024-09-11 20:26:11,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:26:12,882 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:26:12,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:26:12 BoogieIcfgContainer [2024-09-11 20:26:12,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:26:12,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:26:12,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:26:12,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:26:12,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:32" (3/4) ... [2024-09-11 20:26:12,904 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:26:12,906 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2024-09-11 20:26:12,908 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:26:12,908 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:26:12,909 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:26:12,909 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:26:12,969 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:26:12,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:26:12,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:26:12,970 INFO L158 Benchmark]: Toolchain (without parser) took 41107.49ms. Allocated memory was 184.5MB in the beginning and 778.0MB in the end (delta: 593.5MB). Free memory was 115.0MB in the beginning and 543.9MB in the end (delta: -428.9MB). Peak memory consumption was 165.0MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,970 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:26:12,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.79ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 154.0MB in the end (delta: -39.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.21ms. Allocated memory is still 184.5MB. Free memory was 154.0MB in the beginning and 152.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,971 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,971 INFO L158 Benchmark]: RCFGBuilder took 227.72ms. Allocated memory is still 184.5MB. Free memory was 150.8MB in the beginning and 140.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,972 INFO L158 Benchmark]: TraceAbstraction took 40549.41ms. Allocated memory was 184.5MB in the beginning and 778.0MB in the end (delta: 593.5MB). Free memory was 139.4MB in the beginning and 549.2MB in the end (delta: -409.8MB). Peak memory consumption was 457.7MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,972 INFO L158 Benchmark]: Witness Printer took 67.83ms. Allocated memory is still 778.0MB. Free memory was 548.1MB in the beginning and 543.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:26:12,973 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.79ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 154.0MB in the end (delta: -39.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.21ms. Allocated memory is still 184.5MB. Free memory was 154.0MB in the beginning and 152.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 227.72ms. Allocated memory is still 184.5MB. Free memory was 150.8MB in the beginning and 140.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40549.41ms. Allocated memory was 184.5MB in the beginning and 778.0MB in the end (delta: 593.5MB). Free memory was 139.4MB in the beginning and 549.2MB in the end (delta: -409.8MB). Peak memory consumption was 457.7MB. Max. memory is 16.1GB. * Witness Printer took 67.83ms. Allocated memory is still 778.0MB. Free memory was 548.1MB in the beginning and 543.9MB 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: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 1484 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1367 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2370 IncrementalHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 117 mSDtfsCounter, 2370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 174, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 3457 SizeOfPredicates, 22 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 3280/5280 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: 26]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi. Ensures: ((((((((((((((((\old(n) <= 13) && (8191 <= \result)) || ((3 <= \result) && (\old(n) <= 2))) || ((\old(n) <= 11) && (2047 <= \result))) || ((\old(n) <= 6) && (63 <= \result))) || ((511 <= \result) && (\old(n) <= 9))) || ((\old(n) <= 7) && (127 <= \result))) || (33554430 < \result)) || ((\old(n) <= 8) && (255 <= \result))) || ((\old(n) <= 12) && (4095 <= \result))) || ((\result == 1) && (\old(n) == 1))) || ((\old(n) <= 5) && (31 <= \result))) || ((1023 <= \result) && (\old(n) <= 10))) || ((7 <= \result) && (\old(n) <= 3))) || ((16383 <= \result) && ((8178 + \old(n)) <= \result))) || ((15 <= \result) && (\old(n) <= 4))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:26:13,011 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