./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --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:27:31,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:27:31,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:27:31,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:27:31,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:27:31,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:27:31,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:27:31,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:27:31,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:27:31,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:27:31,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:27:31,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:27:31,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:27:31,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:27:31,977 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:27:31,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:27:31,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:27:31,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:27:31,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:27:31,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:27:31,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:27:31,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:27:31,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:27:31,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:27:31,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:27:31,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:27:31,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:27:31,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:27:31,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:27:31,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:27:31,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:27:31,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:27:31,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:27:31,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:27:31,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:27:31,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:27:31,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:27:31,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:27:31,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:27:31,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:27:32,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:27:32,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:27:32,001 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 -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 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:27:32,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:27:32,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:27:32,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:27:32,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:27:32,280 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:27:32,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-11 20:27:33,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:27:33,874 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:27:33,875 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-11 20:27:33,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/530614a5e/a7365e64394c4f809cbdb0b170d2905e/FLAGa79ca3e57 [2024-09-11 20:27:34,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/530614a5e/a7365e64394c4f809cbdb0b170d2905e [2024-09-11 20:27:34,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:27:34,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:27:34,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:27:34,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:27:34,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:27:34,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f78acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34, skipping insertion in model container [2024-09-11 20:27:34,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:27:34,392 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-simple/fibo_2calls_5-1.c[946,959] [2024-09-11 20:27:34,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:27:34,405 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:27:34,419 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-simple/fibo_2calls_5-1.c[946,959] [2024-09-11 20:27:34,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:27:34,434 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:27:34,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34 WrapperNode [2024-09-11 20:27:34,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:27:34,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:27:34,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:27:34,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:27:34,446 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:27:34" (1/1) ... [2024-09-11 20:27:34,454 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:27:34" (1/1) ... [2024-09-11 20:27:34,469 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-09-11 20:27:34,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:27:34,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:27:34,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:27:34,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:27:34,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,503 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:27:34,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:27:34,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:27:34,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:27:34,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:27:34,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (1/1) ... [2024-09-11 20:27:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:27:34,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:34,545 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:27:34,549 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:27:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:27:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:27:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-11 20:27:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-11 20:27:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-11 20:27:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-11 20:27:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:27:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:27:34,639 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:27:34,641 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:27:34,745 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 20:27:34,746 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:27:34,770 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:27:34,770 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:27:34,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:34 BoogieIcfgContainer [2024-09-11 20:27:34,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:27:34,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:27:34,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:27:34,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:27:34,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:27:34" (1/3) ... [2024-09-11 20:27:34,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@924ec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:27:34, skipping insertion in model container [2024-09-11 20:27:34,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:34" (2/3) ... [2024-09-11 20:27:34,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@924ec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:27:34, skipping insertion in model container [2024-09-11 20:27:34,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:34" (3/3) ... [2024-09-11 20:27:34,782 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2024-09-11 20:27:34,799 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:27:34,799 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:27:34,862 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:27:34,869 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;@70125892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:27:34,869 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:27:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:27:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 20:27:34,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:34,879 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:34,880 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:34,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-09-11 20:27:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894538978] [2024-09-11 20:27:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:34,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,225 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:27:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:35,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894538978] [2024-09-11 20:27:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894538978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:27:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:27:35,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:27:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220892793] [2024-09-11 20:27:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:27:35,241 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:27:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:27:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:35,262 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:27:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:35,353 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-09-11 20:27:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:27:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-11 20:27:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:35,362 INFO L225 Difference]: With dead ends: 36 [2024-09-11 20:27:35,362 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:27:35,364 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:35,367 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:35,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:27:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-11 20:27:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-11 20:27:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-09-11 20:27:35,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-09-11 20:27:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:35,410 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-09-11 20:27:35,410 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:27:35,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-09-11 20:27:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:27:35,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:35,412 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:35,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:27:35,413 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:35,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-09-11 20:27:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737029863] [2024-09-11 20:27:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,514 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:27:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737029863] [2024-09-11 20:27:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737029863] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:27:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:27:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:27:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653995660] [2024-09-11 20:27:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:27:35,519 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:27:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:27:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:35,520 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:27:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:35,579 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-11 20:27:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:27:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:27:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:35,582 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:27:35,583 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:27:35,584 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:35,585 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:35,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:27:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:27:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-11 20:27:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-11 20:27:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-09-11 20:27:35,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-09-11 20:27:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:35,603 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-09-11 20:27:35,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:27:35,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-09-11 20:27:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 20:27:35,605 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:35,605 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:35,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:27:35,607 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:35,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-09-11 20:27:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477271932] [2024-09-11 20:27:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:27:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,814 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:27:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477271932] [2024-09-11 20:27:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477271932] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135756569] [2024-09-11 20:27:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:35,822 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:27:35,824 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:27:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:35,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:27:35,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:36,036 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:27:36,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:36,269 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:27:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135756569] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:36,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-11 20:27:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920555822] [2024-09-11 20:27:36,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:36,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:27:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:27:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:27:36,274 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:27:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:36,407 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-09-11 20:27:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:27:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-09-11 20:27:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:36,409 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:27:36,409 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 20:27:36,409 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:27:36,410 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:36,411 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 20:27:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-09-11 20:27:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:27:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-11 20:27:36,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-09-11 20:27:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:36,422 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-11 20:27:36,423 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:27:36,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-11 20:27:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:27:36,426 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:36,426 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:36,443 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:27:36,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:36,631 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-09-11 20:27:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614684767] [2024-09-11 20:27:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:36,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:36,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:36,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:36,815 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:27:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614684767] [2024-09-11 20:27:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614684767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870846253] [2024-09-11 20:27:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:36,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:36,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:36,819 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:27:36,821 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:27:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:36,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:27:36,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:36,903 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:27:36,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:37,066 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:27:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870846253] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:37,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-11 20:27:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360265361] [2024-09-11 20:27:37,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:37,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:27:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:37,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:27:37,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:27:37,069 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:27:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:37,260 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-09-11 20:27:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:27:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-09-11 20:27:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:37,263 INFO L225 Difference]: With dead ends: 52 [2024-09-11 20:27:37,263 INFO L226 Difference]: Without dead ends: 48 [2024-09-11 20:27:37,264 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:27:37,267 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:37,269 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-11 20:27:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-11 20:27:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-11 20:27:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-09-11 20:27:37,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-09-11 20:27:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:37,285 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-09-11 20:27:37,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:27:37,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-09-11 20:27:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:27:37,290 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:37,290 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:37,306 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:27:37,490 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:37,491 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:37,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-09-11 20:27:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293097829] [2024-09-11 20:27:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:27:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 20:27:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:27:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293097829] [2024-09-11 20:27:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293097829] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754194839] [2024-09-11 20:27:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:37,615 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:27:37,619 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:27:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:37,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:37,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:27:37,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:27:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754194839] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:38,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-11 20:27:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128573586] [2024-09-11 20:27:38,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:38,136 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:27:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:27:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:27:38,137 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:38,344 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-09-11 20:27:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:27:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2024-09-11 20:27:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:38,347 INFO L225 Difference]: With dead ends: 108 [2024-09-11 20:27:38,347 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 20:27:38,348 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:27:38,351 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:38,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 106 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 20:27:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-11 20:27:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-09-11 20:27:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-09-11 20:27:38,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-09-11 20:27:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:38,377 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-09-11 20:27:38,377 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:38,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-09-11 20:27:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 20:27:38,381 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:38,381 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:38,397 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:27:38,582 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:38,582 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:38,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-09-11 20:27:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894527537] [2024-09-11 20:27:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:27:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894527537] [2024-09-11 20:27:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894527537] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:38,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678779538] [2024-09-11 20:27:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:38,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:38,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:38,726 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:27:38,728 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:27:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:38,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:38,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:27:38,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:27:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678779538] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:39,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-09-11 20:27:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393226329] [2024-09-11 20:27:39,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:39,173 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:27:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:27:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:27:39,174 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:39,468 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-09-11 20:27:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:27:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2024-09-11 20:27:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:39,472 INFO L225 Difference]: With dead ends: 178 [2024-09-11 20:27:39,472 INFO L226 Difference]: Without dead ends: 118 [2024-09-11 20:27:39,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:27:39,475 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:39,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 238 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-11 20:27:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-09-11 20:27:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-09-11 20:27:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-09-11 20:27:39,506 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-09-11 20:27:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:39,507 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-09-11 20:27:39,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:39,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-09-11 20:27:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:27:39,510 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:39,510 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:39,526 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:27:39,710 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:39,710 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:39,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-09-11 20:27:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764356283] [2024-09-11 20:27:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:27:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-11 20:27:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764356283] [2024-09-11 20:27:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764356283] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963534227] [2024-09-11 20:27:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:39,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:39,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:39,906 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:27:39,907 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:27:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:39,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:27:39,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 20:27:40,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:27:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963534227] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:40,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-09-11 20:27:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071108170] [2024-09-11 20:27:40,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:40,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:27:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:27:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:27:40,546 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-11 20:27:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:40,905 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2024-09-11 20:27:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:27:40,906 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) Word has length 50 [2024-09-11 20:27:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:40,912 INFO L225 Difference]: With dead ends: 248 [2024-09-11 20:27:40,912 INFO L226 Difference]: Without dead ends: 151 [2024-09-11 20:27:40,917 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:27:40,918 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:40,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 220 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:27:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-09-11 20:27:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2024-09-11 20:27:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2024-09-11 20:27:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2024-09-11 20:27:40,952 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2024-09-11 20:27:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:40,952 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2024-09-11 20:27:40,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-11 20:27:40,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2024-09-11 20:27:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-11 20:27:40,959 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:40,959 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:40,974 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:27:41,162 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:27:41,163 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:41,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2024-09-11 20:27:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667334745] [2024-09-11 20:27:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:27:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:27:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667334745] [2024-09-11 20:27:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667334745] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058664888] [2024-09-11 20:27:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:41,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:41,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:41,503 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:27:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:41,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:41,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-09-11 20:27:41,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-11 20:27:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058664888] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:42,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-09-11 20:27:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669398816] [2024-09-11 20:27:42,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:42,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:27:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:27:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:27:42,061 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-09-11 20:27:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:42,433 INFO L93 Difference]: Finished difference Result 250 states and 492 transitions. [2024-09-11 20:27:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 20:27:42,434 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 106 [2024-09-11 20:27:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:42,436 INFO L225 Difference]: With dead ends: 250 [2024-09-11 20:27:42,436 INFO L226 Difference]: Without dead ends: 133 [2024-09-11 20:27:42,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 230 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:27:42,439 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:42,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 263 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:27:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-09-11 20:27:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2024-09-11 20:27:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 74 states have internal predecessors, (90), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (60), 24 states have call predecessors, (60), 23 states have call successors, (60) [2024-09-11 20:27:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-09-11 20:27:42,460 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 106 [2024-09-11 20:27:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:42,460 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-09-11 20:27:42,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-09-11 20:27:42,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-09-11 20:27:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-11 20:27:42,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:42,463 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:42,479 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 20:27:42,667 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:42,668 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:42,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1844149995, now seen corresponding path program 2 times [2024-09-11 20:27:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064513878] [2024-09-11 20:27:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:42,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:42,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:42,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-11 20:27:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 119 proven. 210 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-09-11 20:27:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064513878] [2024-09-11 20:27:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064513878] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715141658] [2024-09-11 20:27:43,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:27:43,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:43,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:43,290 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:27:43,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:27:43,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:27:43,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:27:43,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 77 proven. 135 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-09-11 20:27:43,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 79 proven. 137 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-09-11 20:27:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715141658] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:44,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:44,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2024-09-11 20:27:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440974354] [2024-09-11 20:27:44,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:44,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:27:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:27:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:27:44,231 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) [2024-09-11 20:27:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:44,830 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2024-09-11 20:27:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-11 20:27:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) Word has length 160 [2024-09-11 20:27:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:44,833 INFO L225 Difference]: With dead ends: 284 [2024-09-11 20:27:44,833 INFO L226 Difference]: Without dead ends: 135 [2024-09-11 20:27:44,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:27:44,836 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 78 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:44,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 370 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:27:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-11 20:27:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2024-09-11 20:27:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 12 states have call predecessors, (21), 16 states have return successors, (50), 26 states have call predecessors, (50), 21 states have call successors, (50) [2024-09-11 20:27:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 162 transitions. [2024-09-11 20:27:44,855 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 162 transitions. Word has length 160 [2024-09-11 20:27:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:44,855 INFO L474 AbstractCegarLoop]: Abstraction has 117 states and 162 transitions. [2024-09-11 20:27:44,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) [2024-09-11 20:27:44,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-09-11 20:27:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-11 20:27:44,857 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:44,858 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:44,874 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:27:45,061 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:45,062 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:45,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash 453542388, now seen corresponding path program 1 times [2024-09-11 20:27:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732095687] [2024-09-11 20:27:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:27:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-11 20:27:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:45,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732095687] [2024-09-11 20:27:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732095687] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209536336] [2024-09-11 20:27:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:45,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:45,335 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:27:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:45,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:45,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-09-11 20:27:45,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-09-11 20:27:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209536336] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:45,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 19 [2024-09-11 20:27:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378417691] [2024-09-11 20:27:45,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:45,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:27:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:27:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:27:45,792 INFO L87 Difference]: Start difference. First operand 117 states and 162 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-11 20:27:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:46,026 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2024-09-11 20:27:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:27:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) Word has length 91 [2024-09-11 20:27:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:46,029 INFO L225 Difference]: With dead ends: 242 [2024-09-11 20:27:46,029 INFO L226 Difference]: Without dead ends: 134 [2024-09-11 20:27:46,033 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:27:46,033 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:46,034 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 188 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-11 20:27:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-09-11 20:27:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 85 states have internal predecessors, (99), 22 states have call successors, (22), 13 states have call predecessors, (22), 18 states have return successors, (46), 29 states have call predecessors, (46), 22 states have call successors, (46) [2024-09-11 20:27:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2024-09-11 20:27:46,069 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 91 [2024-09-11 20:27:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:46,069 INFO L474 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2024-09-11 20:27:46,069 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-11 20:27:46,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2024-09-11 20:27:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-11 20:27:46,071 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:46,071 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:46,089 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:27:46,275 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:46,276 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:46,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1604070482, now seen corresponding path program 2 times [2024-09-11 20:27:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026335127] [2024-09-11 20:27:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:27:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 108 proven. 97 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-09-11 20:27:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026335127] [2024-09-11 20:27:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026335127] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227202674] [2024-09-11 20:27:46,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:27:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:46,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:27:46,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:27:46,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:27:46,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:27:46,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 112 proven. 24 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-09-11 20:27:46,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-09-11 20:27:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227202674] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:47,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2024-09-11 20:27:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950673001] [2024-09-11 20:27:47,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:47,347 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:27:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:27:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:27:47,348 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) [2024-09-11 20:27:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:47,791 INFO L93 Difference]: Finished difference Result 259 states and 386 transitions. [2024-09-11 20:27:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-11 20:27:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) Word has length 118 [2024-09-11 20:27:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:47,795 INFO L225 Difference]: With dead ends: 259 [2024-09-11 20:27:47,795 INFO L226 Difference]: Without dead ends: 136 [2024-09-11 20:27:47,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1666, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 20:27:47,798 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:47,798 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 246 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:27:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-09-11 20:27:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2024-09-11 20:27:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 62 states have internal predecessors, (72), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (27), 17 states have call predecessors, (27), 16 states have call successors, (27) [2024-09-11 20:27:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2024-09-11 20:27:47,818 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 118 [2024-09-11 20:27:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:47,818 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2024-09-11 20:27:47,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) [2024-09-11 20:27:47,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2024-09-11 20:27:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-11 20:27:47,821 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:47,822 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:47,836 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-11 20:27:48,026 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 20:27:48,026 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:48,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1780776373, now seen corresponding path program 3 times [2024-09-11 20:27:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322788507] [2024-09-11 20:27:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:27:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-11 20:27:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322788507] [2024-09-11 20:27:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322788507] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104774386] [2024-09-11 20:27:48,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:27:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:48,782 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:48,783 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:27:48,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-11 20:27:48,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:27:48,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-11 20:27:48,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-11 20:27:49,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-11 20:27:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104774386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:49,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2024-09-11 20:27:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769053325] [2024-09-11 20:27:49,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:49,452 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 20:27:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 20:27:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:27:49,453 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-11 20:27:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:49,625 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2024-09-11 20:27:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:27:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) Word has length 105 [2024-09-11 20:27:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:49,628 INFO L225 Difference]: With dead ends: 113 [2024-09-11 20:27:49,628 INFO L226 Difference]: Without dead ends: 109 [2024-09-11 20:27:49,628 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:27:49,629 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:49,629 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-11 20:27:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-09-11 20:27:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 73 states have internal predecessors, (83), 19 states have call successors, (19), 11 states have call predecessors, (19), 15 states have return successors, (35), 24 states have call predecessors, (35), 19 states have call successors, (35) [2024-09-11 20:27:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2024-09-11 20:27:49,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 105 [2024-09-11 20:27:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:49,650 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2024-09-11 20:27:49,650 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-11 20:27:49,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2024-09-11 20:27:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-11 20:27:49,652 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:49,652 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:49,668 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:27:49,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 20:27:49,856 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:49,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash -287769935, now seen corresponding path program 1 times [2024-09-11 20:27:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:49,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087885239] [2024-09-11 20:27:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:49,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:49,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:49,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:49,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:27:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:27:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-11 20:27:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 35 proven. 64 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-09-11 20:27:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087885239] [2024-09-11 20:27:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087885239] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265362570] [2024-09-11 20:27:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:50,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:50,063 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:27:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:50,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 20:27:50,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-09-11 20:27:50,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 38 proven. 102 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-09-11 20:27:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265362570] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:50,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:50,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 13] total 19 [2024-09-11 20:27:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283768511] [2024-09-11 20:27:50,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:50,932 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:27:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:27:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:27:50,933 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) [2024-09-11 20:27:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:51,154 INFO L93 Difference]: Finished difference Result 211 states and 275 transitions. [2024-09-11 20:27:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:27:51,154 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) Word has length 106 [2024-09-11 20:27:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:51,155 INFO L225 Difference]: With dead ends: 211 [2024-09-11 20:27:51,155 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:27:51,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 227 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2024-09-11 20:27:51,157 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:51,157 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 290 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:27:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:27:51,158 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:27:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:27:51,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-09-11 20:27:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:51,159 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:27:51,159 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) [2024-09-11 20:27:51,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:27:51,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:27:51,162 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:27:51,177 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-11 20:27:51,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:51,369 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:51,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:27:56,355 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:27:56,386 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:27:56,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:27:56 BoogieIcfgContainer [2024-09-11 20:27:56,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:27:56,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:27:56,388 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:27:56,388 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:27:56,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:34" (3/4) ... [2024-09-11 20:27:56,391 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:27:56,394 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-09-11 20:27:56,395 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-09-11 20:27:56,398 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:27:56,399 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:27:56,399 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:27:56,399 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:27:56,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:27:56,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:27:56,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:27:56,487 INFO L158 Benchmark]: Toolchain (without parser) took 22268.15ms. Allocated memory was 161.5MB in the beginning and 503.3MB in the end (delta: 341.8MB). Free memory was 128.3MB in the beginning and 193.0MB in the end (delta: -64.8MB). Peak memory consumption was 280.2MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,487 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 161.5MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:27:56,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 116.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.29ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,488 INFO L158 Benchmark]: Boogie Preprocessor took 44.51ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:27:56,488 INFO L158 Benchmark]: RCFGBuilder took 255.79ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 101.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,488 INFO L158 Benchmark]: TraceAbstraction took 21613.28ms. Allocated memory was 161.5MB in the beginning and 503.3MB in the end (delta: 341.8MB). Free memory was 101.2MB in the beginning and 198.3MB in the end (delta: -97.0MB). Peak memory consumption was 248.7MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,488 INFO L158 Benchmark]: Witness Printer took 99.16ms. Allocated memory is still 503.3MB. Free memory was 197.2MB in the beginning and 193.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:27:56,490 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.22ms. Allocated memory is still 161.5MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 116.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.29ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.51ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.79ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 101.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21613.28ms. Allocated memory was 161.5MB in the beginning and 503.3MB in the end (delta: 341.8MB). Free memory was 101.2MB in the beginning and 198.3MB in the end (delta: -97.0MB). Peak memory consumption was 248.7MB. Max. memory is 16.1GB. * Witness Printer took 99.16ms. Allocated memory is still 503.3MB. Free memory was 197.2MB in the beginning and 193.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 13, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 3153 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2792 mSDsCounter, 401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 401 mSolverCounterUnsat, 361 mSDtfsCounter, 3991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2160 GetRequests, 1846 SyntacticMatches, 39 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=10, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 164 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1723 NumberOfCodeBlocks, 1723 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2540 ConstructedInterpolants, 0 QuantifiedInterpolants, 4910 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2122 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 4779/6312 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: 40]: Location Invariant Derived location invariant: (5 <= x) - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((((((((2 == \result) && (3 == \old(n))) || (\old(n) == 1)) || (4 < \old(n))) || (\old(n) < 1)) || (\old(n) == 4)) && ((((((2 == \result) && (3 == \old(n))) || ((\result == 1) && (\old(n) == 1))) || (3 == \result)) || (4 < \old(n))) || (\old(n) < 1))) && (((\result == 0) || (\old(n) == 1)) || (1 < \old(n)))) && ((((\result == 1) && (\old(n) == 1)) || (2 < \old(n))) || (\old(n) < 1))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: (((\result == 0) || (1 < \old(n))) || ((\old(n) == 1) && (\result == 1))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:27:56,513 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