./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-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 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:12:24,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:12:25,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:12:25,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:12:25,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:12:25,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:12:25,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:12:25,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:12:25,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:12:25,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:12:25,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:12:25,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:12:25,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:12:25,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:12:25,036 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:12:25,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:12:25,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:12:25,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:12:25,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:12:25,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:12:25,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:12:25,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:12:25,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:12:25,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:12:25,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:12:25,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:12:25,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:12:25,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:12:25,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:12:25,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:12:25,043 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 -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:12:25,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:12:25,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:12:25,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:12:25,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:12:25,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:12:25,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-10-15 15:12:26,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:12:26,676 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:12:26,676 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-10-15 15:12:26,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0af3cc712/9feb58673053459bbedcdcd48304d67f/FLAG8b252f1a3 [2024-10-15 15:12:26,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0af3cc712/9feb58673053459bbedcdcd48304d67f [2024-10-15 15:12:26,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:12:26,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:12:26,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:12:26,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:12:26,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:12:26,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377856ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26, skipping insertion in model container [2024-10-15 15:12:26,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:12:26,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2024-10-15 15:12:26,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:12:26,916 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:12:26,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2024-10-15 15:12:26,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:12:26,942 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:12:26,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26 WrapperNode [2024-10-15 15:12:26,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:12:26,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:12:26,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:12:26,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:12:26,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,963 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:12:26,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:12:26,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:12:26,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:12:26,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:12:26,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,982 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-10-15 15:12:26,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:12:26,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:12:26,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:12:26,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:12:26,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (1/1) ... [2024-10-15 15:12:26,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:12:27,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:27,014 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-10-15 15:12:27,019 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-10-15 15:12:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:12:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:12:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:12:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:12:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-15 15:12:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-15 15:12:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-15 15:12:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-15 15:12:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:12:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:12:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:12:27,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:12:27,101 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:12:27,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:12:27,212 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-15 15:12:27,213 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:12:27,228 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:12:27,229 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:12:27,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:12:27 BoogieIcfgContainer [2024-10-15 15:12:27,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:12:27,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:12:27,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:12:27,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:12:27,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:12:26" (1/3) ... [2024-10-15 15:12:27,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4158c954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:12:27, skipping insertion in model container [2024-10-15 15:12:27,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:12:26" (2/3) ... [2024-10-15 15:12:27,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4158c954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:12:27, skipping insertion in model container [2024-10-15 15:12:27,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:12:27" (3/3) ... [2024-10-15 15:12:27,235 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2024-10-15 15:12:27,250 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:12:27,250 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:12:27,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:12:27,297 INFO L333 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;@7edcf252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:12:27,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:12:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 15:12:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-15 15:12:27,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:27,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:27,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-10-15 15:12:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038668685] [2024-10-15 15:12:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:12:27,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:27,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038668685] [2024-10-15 15:12:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038668685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:12:27,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:12:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:12:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819658731] [2024-10-15 15:12:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:12:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:12:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:12:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:12:27,547 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:12:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:27,630 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-15 15:12:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:12:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-15 15:12:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:27,639 INFO L225 Difference]: With dead ends: 44 [2024-10-15 15:12:27,640 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 15:12:27,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-15 15:12:27,644 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 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-10-15 15:12:27,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 15:12:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-10-15 15:12:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-15 15:12:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-15 15:12:27,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-10-15 15:12:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:27,676 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-15 15:12:27,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:12:27,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-15 15:12:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 15:12:27,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:27,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:12:27,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:27,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-10-15 15:12:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484202126] [2024-10-15 15:12:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:12:27,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484202126] [2024-10-15 15:12:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484202126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:12:27,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:12:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:12:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370232702] [2024-10-15 15:12:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:12:27,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:12:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:12:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:12:27,780 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:12:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:27,836 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-15 15:12:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:12:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-15 15:12:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:27,838 INFO L225 Difference]: With dead ends: 36 [2024-10-15 15:12:27,838 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 15:12:27,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-15 15:12:27,839 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:27,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:12:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 15:12:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-10-15 15:12:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-15 15:12:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-15 15:12:27,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-10-15 15:12:27,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:27,849 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-15 15:12:27,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:12:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-15 15:12:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 15:12:27,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:27,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:27,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:12:27,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-10-15 15:12:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:27,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301579041] [2024-10-15 15:12:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-15 15:12:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:28,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301579041] [2024-10-15 15:12:28,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301579041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645311199] [2024-10-15 15:12:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:28,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:28,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:28,050 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-10-15 15:12:28,051 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:12:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 15:12:28,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:28,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645311199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:28,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-15 15:12:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696160812] [2024-10-15 15:12:28,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:28,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 15:12:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 15:12:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:12:28,372 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-15 15:12:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:28,500 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-10-15 15:12:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:12:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2024-10-15 15:12:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:28,501 INFO L225 Difference]: With dead ends: 58 [2024-10-15 15:12:28,502 INFO L226 Difference]: Without dead ends: 34 [2024-10-15 15:12:28,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 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-10-15 15:12:28,503 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:28,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-15 15:12:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-15 15:12:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-15 15:12:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-15 15:12:28,509 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-10-15 15:12:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-15 15:12:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-15 15:12:28,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-15 15:12:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 15:12:28,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:28,514 INFO L215 NwaCegarLoop]: trace histogram [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-10-15 15:12:28,527 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 15:12:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:28,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-10-15 15:12:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688051740] [2024-10-15 15:12:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688051740] [2024-10-15 15:12:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688051740] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819411509] [2024-10-15 15:12:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:28,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:28,836 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-10-15 15:12:28,838 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:12:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:28,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 15:12:28,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:28,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:12:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819411509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:29,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-15 15:12:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020869595] [2024-10-15 15:12:29,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 15:12:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 15:12:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:12:29,058 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 15:12:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:29,208 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-10-15 15:12:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:12:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2024-10-15 15:12:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:29,211 INFO L225 Difference]: With dead ends: 56 [2024-10-15 15:12:29,211 INFO L226 Difference]: Without dead ends: 52 [2024-10-15 15:12:29,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 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-10-15 15:12:29,212 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:29,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-15 15:12:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-15 15:12:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-15 15:12:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-10-15 15:12:29,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 27 [2024-10-15 15:12:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-10-15 15:12:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 15:12:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-10-15 15:12:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-15 15:12:29,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:29,232 INFO L215 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, 1, 1, 1] [2024-10-15 15:12:29,247 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 15:12:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:29,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-10-15 15:12:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944260709] [2024-10-15 15:12:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-15 15:12:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 15:12:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:12:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944260709] [2024-10-15 15:12:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944260709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893308454] [2024-10-15 15:12:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:29,543 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-10-15 15:12:29,543 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:12:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:29,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 15:12:29,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 15:12:29,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:12:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893308454] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:29,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-10-15 15:12:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664021494] [2024-10-15 15:12:29,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 15:12:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 15:12:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-15 15:12:29,893 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 15:12:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:30,098 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2024-10-15 15:12:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 15:12:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2024-10-15 15:12:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:30,100 INFO L225 Difference]: With dead ends: 112 [2024-10-15 15:12:30,100 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 15:12:30,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-15 15:12:30,101 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:30,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 15:12:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-15 15:12:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2024-10-15 15:12:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-10-15 15:12:30,118 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2024-10-15 15:12:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:30,119 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-10-15 15:12:30,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 15:12:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-10-15 15:12:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-15 15:12:30,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:30,122 INFO L215 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, 1, 1, 1, 1] [2024-10-15 15:12:30,143 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 15:12:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:30,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1261961157, now seen corresponding path program 1 times [2024-10-15 15:12:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838621456] [2024-10-15 15:12:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:12:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-15 15:12:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838621456] [2024-10-15 15:12:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838621456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698982606] [2024-10-15 15:12:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:30,464 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-10-15 15:12:30,466 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:12:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:30,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 15:12:30,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:12:30,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:12:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698982606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:30,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-10-15 15:12:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263049249] [2024-10-15 15:12:30,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:30,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 15:12:30,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 15:12:30,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:12:30,808 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-15 15:12:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:31,043 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-10-15 15:12:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:12:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 40 [2024-10-15 15:12:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:31,045 INFO L225 Difference]: With dead ends: 182 [2024-10-15 15:12:31,046 INFO L226 Difference]: Without dead ends: 122 [2024-10-15 15:12:31,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:12:31,047 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:31,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 268 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:12:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-15 15:12:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2024-10-15 15:12:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 23 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (64), 26 states have call predecessors, (64), 22 states have call successors, (64) [2024-10-15 15:12:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-10-15 15:12:31,066 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 40 [2024-10-15 15:12:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-10-15 15:12:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-15 15:12:31,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-10-15 15:12:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 15:12:31,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:31,069 INFO L215 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, 1, 1, 1, 1] [2024-10-15 15:12:31,081 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 15:12:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:31,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:31,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1624375296, now seen corresponding path program 1 times [2024-10-15 15:12:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060322622] [2024-10-15 15:12:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:12:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 15:12:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-15 15:12:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:31,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060322622] [2024-10-15 15:12:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060322622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:31,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311113364] [2024-10-15 15:12:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:31,443 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-10-15 15:12:31,444 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:12:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:31,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 15:12:31,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-15 15:12:31,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 15:12:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311113364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:31,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:31,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-10-15 15:12:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347988065] [2024-10-15 15:12:31,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:31,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 15:12:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 15:12:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-15 15:12:31,805 INFO L87 Difference]: Start difference. First operand 103 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-15 15:12:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:32,015 INFO L93 Difference]: Finished difference Result 265 states and 513 transitions. [2024-10-15 15:12:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 15:12:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Word has length 54 [2024-10-15 15:12:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:32,018 INFO L225 Difference]: With dead ends: 265 [2024-10-15 15:12:32,018 INFO L226 Difference]: Without dead ends: 168 [2024-10-15 15:12:32,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-10-15 15:12:32,019 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:32,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 185 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:12:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-15 15:12:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2024-10-15 15:12:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 19 states have return successors, (104), 38 states have call predecessors, (104), 32 states have call successors, (104) [2024-10-15 15:12:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 244 transitions. [2024-10-15 15:12:32,047 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 244 transitions. Word has length 54 [2024-10-15 15:12:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:32,048 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 244 transitions. [2024-10-15 15:12:32,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-15 15:12:32,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 244 transitions. [2024-10-15 15:12:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-15 15:12:32,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:32,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:32,065 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 15:12:32,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 15:12:32,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1735862535, now seen corresponding path program 1 times [2024-10-15 15:12:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839754531] [2024-10-15 15:12:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:12:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 15:12:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 15:12:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839754531] [2024-10-15 15:12:32,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839754531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709598302] [2024-10-15 15:12:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:32,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:32,424 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-10-15 15:12:32,426 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 15:12:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:32,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 15:12:32,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 15:12:32,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 15:12:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709598302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:32,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:32,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-10-15 15:12:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973068314] [2024-10-15 15:12:32,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:32,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 15:12:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 15:12:32,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:12:32,659 INFO L87 Difference]: Start difference. First operand 142 states and 244 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2024-10-15 15:12:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:32,910 INFO L93 Difference]: Finished difference Result 347 states and 700 transitions. [2024-10-15 15:12:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:12:32,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) Word has length 55 [2024-10-15 15:12:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:32,913 INFO L225 Difference]: With dead ends: 347 [2024-10-15 15:12:32,914 INFO L226 Difference]: Without dead ends: 120 [2024-10-15 15:12:32,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:12:32,919 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:32,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 286 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:12:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-15 15:12:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2024-10-15 15:12:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.180327868852459) internal successors, (72), 62 states have internal predecessors, (72), 22 states have call successors, (22), 9 states have call predecessors, (22), 13 states have return successors, (65), 25 states have call predecessors, (65), 21 states have call successors, (65) [2024-10-15 15:12:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2024-10-15 15:12:32,945 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 55 [2024-10-15 15:12:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:32,946 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2024-10-15 15:12:32,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2024-10-15 15:12:32,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2024-10-15 15:12:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-15 15:12:32,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:32,947 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:32,961 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 15:12:33,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:33,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:33,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1987254780, now seen corresponding path program 2 times [2024-10-15 15:12:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371788187] [2024-10-15 15:12:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:12:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 15:12:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-15 15:12:33,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371788187] [2024-10-15 15:12:33,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371788187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535150323] [2024-10-15 15:12:33,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:12:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:33,362 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-10-15 15:12:33,363 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 15:12:33,415 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:12:33,415 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:12:33,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 15:12:33,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-15 15:12:33,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-15 15:12:33,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535150323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:33,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:33,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-10-15 15:12:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099922862] [2024-10-15 15:12:33,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 15:12:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 15:12:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:12:33,736 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) [2024-10-15 15:12:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:34,062 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2024-10-15 15:12:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-15 15:12:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) Word has length 69 [2024-10-15 15:12:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:34,064 INFO L225 Difference]: With dead ends: 192 [2024-10-15 15:12:34,064 INFO L226 Difference]: Without dead ends: 89 [2024-10-15 15:12:34,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-10-15 15:12:34,065 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:34,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 274 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:12:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-15 15:12:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-10-15 15:12:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (32), 17 states have call predecessors, (32), 13 states have call successors, (32) [2024-10-15 15:12:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-10-15 15:12:34,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 69 [2024-10-15 15:12:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:34,073 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-10-15 15:12:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) [2024-10-15 15:12:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-10-15 15:12:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-15 15:12:34,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:34,075 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:34,087 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 15:12:34,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:34,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:34,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2144655573, now seen corresponding path program 1 times [2024-10-15 15:12:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898702214] [2024-10-15 15:12:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 15:12:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 15:12:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-15 15:12:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898702214] [2024-10-15 15:12:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898702214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734899969] [2024-10-15 15:12:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:34,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:34,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:34,647 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-10-15 15:12:34,648 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 15:12:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:34,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 15:12:34,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-15 15:12:34,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-15 15:12:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734899969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:34,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2024-10-15 15:12:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023679500] [2024-10-15 15:12:34,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 15:12:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 15:12:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-10-15 15:12:34,960 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-15 15:12:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:35,052 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-10-15 15:12:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 15:12:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 68 [2024-10-15 15:12:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:35,055 INFO L225 Difference]: With dead ends: 97 [2024-10-15 15:12:35,055 INFO L226 Difference]: Without dead ends: 93 [2024-10-15 15:12:35,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-10-15 15:12:35,056 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:35,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-15 15:12:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-15 15:12:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 16 states have call successors, (16), 10 states have call predecessors, (16), 14 states have return successors, (39), 21 states have call predecessors, (39), 15 states have call successors, (39) [2024-10-15 15:12:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-15 15:12:35,072 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 68 [2024-10-15 15:12:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-15 15:12:35,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-15 15:12:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-15 15:12:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-15 15:12:35,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:12:35,074 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:35,086 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 15:12:35,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:35,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:12:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2028010288, now seen corresponding path program 1 times [2024-10-15 15:12:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:12:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587673531] [2024-10-15 15:12:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:12:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:12:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:12:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 15:12:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 15:12:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:12:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:12:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-15 15:12:35,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:12:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587673531] [2024-10-15 15:12:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587673531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:12:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944866682] [2024-10-15 15:12:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:12:35,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:12:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:12:35,382 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-10-15 15:12:35,383 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 15:12:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:12:35,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 15:12:35,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:12:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-15 15:12:35,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:12:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-15 15:12:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944866682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:12:35,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:12:35,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-10-15 15:12:35,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112728273] [2024-10-15 15:12:35,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:12:35,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 15:12:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:12:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 15:12:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:12:35,882 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-15 15:12:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:12:36,044 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2024-10-15 15:12:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 15:12:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) Word has length 69 [2024-10-15 15:12:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:12:36,046 INFO L225 Difference]: With dead ends: 162 [2024-10-15 15:12:36,046 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:12:36,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 150 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-10-15 15:12:36,048 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:12:36,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 224 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:12:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:12:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:12:36,048 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-10-15 15:12:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:12:36,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-10-15 15:12:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:12:36,049 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:12:36,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-15 15:12:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:12:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:12:36,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:12:36,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:12:36,065 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-15 15:12:36,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 15:12:36,256 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:12:36,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:12:38,044 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:12:38,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:12:38 BoogieIcfgContainer [2024-10-15 15:12:38,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:12:38,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:12:38,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:12:38,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:12:38,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:12:27" (3/4) ... [2024-10-15 15:12:38,063 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:12:38,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:12:38,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:12:38,105 INFO L158 Benchmark]: Toolchain (without parser) took 11409.17ms. Allocated memory was 132.1MB in the beginning and 264.2MB in the end (delta: 132.1MB). Free memory was 60.8MB in the beginning and 104.3MB in the end (delta: -43.4MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,105 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:12:38,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.88ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 60.7MB in the beginning and 149.9MB in the end (delta: -89.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.63ms. Allocated memory is still 182.5MB. Free memory was 149.9MB in the beginning and 148.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:12:38,106 INFO L158 Benchmark]: Boogie Preprocessor took 23.24ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,106 INFO L158 Benchmark]: RCFGBuilder took 241.46ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 134.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,107 INFO L158 Benchmark]: TraceAbstraction took 10830.54ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 133.2MB in the beginning and 107.4MB in the end (delta: 25.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,107 INFO L158 Benchmark]: Witness Printer took 43.33ms. Allocated memory is still 264.2MB. Free memory was 107.4MB in the beginning and 104.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:12:38,108 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.17ms. Allocated memory is still 132.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.88ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 60.7MB in the beginning and 149.9MB in the end (delta: -89.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.63ms. Allocated memory is still 182.5MB. Free memory was 149.9MB in the beginning and 148.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.24ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 241.46ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 134.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10830.54ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 133.2MB in the beginning and 107.4MB in the end (delta: 25.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * Witness Printer took 43.33ms. Allocated memory is still 264.2MB. Free memory was 107.4MB in the beginning and 104.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2223 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2550 IncrementalHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 334 mSDtfsCounter, 2550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 979 SyntacticMatches, 27 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2751 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 816/1143 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 - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((((\result == 1) && (n == 1)) || (\result == 0)) || (1 < n)) && (((((\result == 1) && (n == 1)) || (n < 1)) || (3 < n)) || ((\result == 1) && (2 == n)))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: (((((\result == 1) || (n < 1)) || (2 < n)) && (((\result == 0) || (1 < n)) || (n == 1))) && ((((3 == n) || (4 < n)) || (n < 2)) || ((3 == \result) && (n == 4)))) RESULT: Ultimate proved your program to be correct! [2024-10-15 15:12:38,131 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