./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-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 ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 --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.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:50:20,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:50:20,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:50:20,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:50:20,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:50:20,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:50:20,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:50:20,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:50:20,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:50:20,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:50:20,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:50:20,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:50:20,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:50:20,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:50:20,454 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:50:20,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:50:20,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:50:20,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:50:20,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:50:20,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:50:20,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:50:20,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:50:20,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:50:20,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:50:20,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:50:20,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:50:20,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:50:20,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:50:20,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:50:20,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:50:20,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:50:20,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:50:20,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:50:20,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:50:20,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:50:20,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:50:20,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:50:20,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:50:20,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:50:20,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:50:20,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:50:20,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:50:20,460 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 -> 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 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-09-20 19:50:20,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:50:20,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:50:20,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:50:20,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:50:20,663 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:50:20,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_5-1.c [2024-09-20 19:50:21,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:50:21,982 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:50:21,983 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_5-1.c [2024-09-20 19:50:21,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e84c8bf14/d062777fd2ed4177bf4f262212f2149a/FLAG24eff152e [2024-09-20 19:50:22,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e84c8bf14/d062777fd2ed4177bf4f262212f2149a [2024-09-20 19:50:22,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:50:22,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:50:22,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:50:22,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:50:22,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:50:22,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a91a102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22, skipping insertion in model container [2024-09-20 19:50:22,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:50:22,518 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_5-1.c[740,753] [2024-09-20 19:50:22,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:50:22,534 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:50:22,552 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_5-1.c[740,753] [2024-09-20 19:50:22,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:50:22,564 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:50:22,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22 WrapperNode [2024-09-20 19:50:22,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:50:22,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:50:22,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:50:22,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:50:22,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,614 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:50:22,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:50:22,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:50:22,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:50:22,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:50:22,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 19:50:22,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:50:22,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:50:22,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:50:22,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:50:22,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (1/1) ... [2024-09-20 19:50:22,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:50:22,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:22,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 19:50:22,679 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 19:50:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:50:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:50:22,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:50:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:50:22,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:50:22,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:50:22,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:50:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:50:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-09-20 19:50:22,710 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-09-20 19:50:22,753 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:50:22,754 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:50:22,837 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 19:50:22,837 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:50:22,855 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:50:22,857 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 19:50:22,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:22 BoogieIcfgContainer [2024-09-20 19:50:22,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:50:22,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:50:22,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:50:22,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:50:22,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:50:22" (1/3) ... [2024-09-20 19:50:22,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40456a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:50:22, skipping insertion in model container [2024-09-20 19:50:22,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:22" (2/3) ... [2024-09-20 19:50:22,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40456a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:50:22, skipping insertion in model container [2024-09-20 19:50:22,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:22" (3/3) ... [2024-09-20 19:50:22,866 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2024-09-20 19:50:22,879 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:50:22,879 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:50:22,915 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:50:22,920 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d8e5794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:50:22,920 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:50:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 19:50:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 19:50:22,928 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:22,928 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:22,928 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:22,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 358193300, now seen corresponding path program 1 times [2024-09-20 19:50:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736351347] [2024-09-20 19:50:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,087 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:50:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736351347] [2024-09-20 19:50:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736351347] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:50:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550261947] [2024-09-20 19:50:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:23,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:23,161 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 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-09-20 19:50:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:23,222 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-20 19:50:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:23,226 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-09-20 19:50:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:23,232 INFO L225 Difference]: With dead ends: 35 [2024-09-20 19:50:23,232 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 19:50:23,234 INFO L433 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-09-20 19:50:23,236 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:23,237 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 19:50:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-20 19:50:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-20 19:50:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 19:50:23,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2024-09-20 19:50:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:23,265 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 19:50:23,265 INFO L475 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-09-20 19:50:23,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 19:50:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 19:50:23,267 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:23,267 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:23,267 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:50:23,267 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:23,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1069801351, now seen corresponding path program 1 times [2024-09-20 19:50:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576733986] [2024-09-20 19:50:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:50:23,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576733986] [2024-09-20 19:50:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576733986] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:50:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137464103] [2024-09-20 19:50:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:23,376 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:23,377 INFO L87 Difference]: Start difference. First operand 21 states and 25 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-09-20 19:50:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:23,427 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-09-20 19:50:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:23,427 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-09-20 19:50:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:23,428 INFO L225 Difference]: With dead ends: 27 [2024-09-20 19:50:23,429 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 19:50:23,429 INFO L433 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-09-20 19:50:23,430 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:23,430 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 19:50:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-20 19:50:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-20 19:50:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 19:50:23,440 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2024-09-20 19:50:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:23,441 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 19:50:23,441 INFO L475 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-09-20 19:50:23,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 19:50:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 19:50:23,442 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:23,442 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:23,443 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:50:23,443 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:23,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -648535868, now seen corresponding path program 1 times [2024-09-20 19:50:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907064888] [2024-09-20 19:50:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 19:50:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 19:50:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:23,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907064888] [2024-09-20 19:50:23,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907064888] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:23,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81251201] [2024-09-20 19:50:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:23,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:23,602 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 19:50:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:23,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:50:23,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 19:50:23,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-20 19:50:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81251201] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:23,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-09-20 19:50:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106381949] [2024-09-20 19:50:23,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:23,955 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 19:50:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:23,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 19:50:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-20 19:50:23,956 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-09-20 19:50:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:24,029 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-20 19:50:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:50:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-09-20 19:50:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:24,031 INFO L225 Difference]: With dead ends: 38 [2024-09-20 19:50:24,031 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 19:50:24,031 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-09-20 19:50:24,033 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:24,033 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 19:50:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 19:50:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-20 19:50:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-20 19:50:24,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2024-09-20 19:50:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:24,041 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-20 19:50:24,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-09-20 19:50:24,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-20 19:50:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 19:50:24,043 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:24,043 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:24,055 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:50:24,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:24,247 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:24,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1169471199, now seen corresponding path program 1 times [2024-09-20 19:50:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255964259] [2024-09-20 19:50:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-20 19:50:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255964259] [2024-09-20 19:50:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255964259] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293323012] [2024-09-20 19:50:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:24,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:24,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:24,378 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 19:50:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:50:24,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-20 19:50:24,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-20 19:50:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293323012] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:24,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-09-20 19:50:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890861241] [2024-09-20 19:50:24,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:24,587 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:50:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:24,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:50:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:50:24,588 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-09-20 19:50:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:24,680 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-20 19:50:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 19:50:24,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-09-20 19:50:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:24,681 INFO L225 Difference]: With dead ends: 41 [2024-09-20 19:50:24,681 INFO L226 Difference]: Without dead ends: 37 [2024-09-20 19:50:24,682 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-09-20 19:50:24,682 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:24,682 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-20 19:50:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-20 19:50:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2024-09-20 19:50:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-09-20 19:50:24,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2024-09-20 19:50:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:24,691 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-09-20 19:50:24,691 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-09-20 19:50:24,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-09-20 19:50:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:50:24,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:24,694 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:24,706 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 19:50:24,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:24,895 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:24,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 413055705, now seen corresponding path program 2 times [2024-09-20 19:50:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914117368] [2024-09-20 19:50:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:24,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-20 19:50:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914117368] [2024-09-20 19:50:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914117368] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121216703] [2024-09-20 19:50:25,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:50:25,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:25,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:25,028 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 19:50:25,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:50:25,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:50:25,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:50:25,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-20 19:50:25,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-20 19:50:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121216703] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:25,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-09-20 19:50:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19326811] [2024-09-20 19:50:25,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:25,409 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 19:50:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 19:50:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:50:25,410 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-20 19:50:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:25,548 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2024-09-20 19:50:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 19:50:25,548 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 40 [2024-09-20 19:50:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:25,549 INFO L225 Difference]: With dead ends: 72 [2024-09-20 19:50:25,549 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 19:50:25,550 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-09-20 19:50:25,551 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:25,551 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 19:50:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 19:50:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-09-20 19:50:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-09-20 19:50:25,558 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2024-09-20 19:50:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:25,559 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-09-20 19:50:25,559 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-20 19:50:25,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-09-20 19:50:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-20 19:50:25,561 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:25,561 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:25,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 19:50:25,761 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:25,762 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:25,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -926093039, now seen corresponding path program 3 times [2024-09-20 19:50:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548200961] [2024-09-20 19:50:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:50:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:25,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:26,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 19:50:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548200961] [2024-09-20 19:50:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548200961] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893034292] [2024-09-20 19:50:26,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 19:50:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:26,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:26,009 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 19:50:26,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-20 19:50:26,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:50:26,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:50:26,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-09-20 19:50:26,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-20 19:50:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893034292] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:26,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 15 [2024-09-20 19:50:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646356228] [2024-09-20 19:50:26,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:26,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 19:50:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 19:50:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:50:26,363 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-20 19:50:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:26,471 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2024-09-20 19:50:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:50:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) Word has length 68 [2024-09-20 19:50:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:26,474 INFO L225 Difference]: With dead ends: 83 [2024-09-20 19:50:26,474 INFO L226 Difference]: Without dead ends: 79 [2024-09-20 19:50:26,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-09-20 19:50:26,475 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:26,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-20 19:50:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-09-20 19:50:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.148936170212766) internal successors, (54), 46 states have internal predecessors, (54), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (32), 18 states have call predecessors, (32), 14 states have call successors, (32) [2024-09-20 19:50:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-09-20 19:50:26,487 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2024-09-20 19:50:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:26,487 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-09-20 19:50:26,487 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-20 19:50:26,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-09-20 19:50:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-20 19:50:26,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:26,489 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:26,502 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-20 19:50:26,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:26,694 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:26,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -257182465, now seen corresponding path program 4 times [2024-09-20 19:50:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386621162] [2024-09-20 19:50:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:26,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:26,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:50:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 19:50:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-20 19:50:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386621162] [2024-09-20 19:50:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386621162] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543935728] [2024-09-20 19:50:27,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 19:50:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:27,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:27,374 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 19:50:27,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 19:50:27,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:50:27,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-20 19:50:27,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-20 19:50:27,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-20 19:50:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543935728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:27,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 20 [2024-09-20 19:50:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928950687] [2024-09-20 19:50:27,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:27,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 19:50:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 19:50:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-09-20 19:50:27,888 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-20 19:50:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:28,033 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-09-20 19:50:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-20 19:50:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-09-20 19:50:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:28,036 INFO L225 Difference]: With dead ends: 135 [2024-09-20 19:50:28,036 INFO L226 Difference]: Without dead ends: 131 [2024-09-20 19:50:28,037 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-09-20 19:50:28,037 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:28,037 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 504 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-20 19:50:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2024-09-20 19:50:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 52 states have internal predecessors, (60), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (46), 22 states have call predecessors, (46), 16 states have call successors, (46) [2024-09-20 19:50:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-09-20 19:50:28,058 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 109 [2024-09-20 19:50:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:28,059 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-09-20 19:50:28,059 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-20 19:50:28,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-09-20 19:50:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-20 19:50:28,061 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:28,061 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:28,074 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 19:50:28,261 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 19:50:28,262 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:28,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 994115606, now seen corresponding path program 5 times [2024-09-20 19:50:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696221005] [2024-09-20 19:50:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:50:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 19:50:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:50:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-09-20 19:50:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696221005] [2024-09-20 19:50:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696221005] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651600736] [2024-09-20 19:50:28,659 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-20 19:50:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:28,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-20 19:50:28,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-09-20 19:50:28,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:50:28,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 19:50:28,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-09-20 19:50:28,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 354 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-09-20 19:50:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651600736] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:29,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:29,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 17] total 29 [2024-09-20 19:50:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158057010] [2024-09-20 19:50:29,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:29,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-20 19:50:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-20 19:50:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2024-09-20 19:50:29,630 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 states have internal predecessors, (78), 21 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (35), 17 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-20 19:50:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:29,892 INFO L93 Difference]: Finished difference Result 154 states and 259 transitions. [2024-09-20 19:50:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 19:50:29,892 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 states have internal predecessors, (78), 21 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (35), 17 states have call predecessors, (35), 21 states have call successors, (35) Word has length 136 [2024-09-20 19:50:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:29,894 INFO L225 Difference]: With dead ends: 154 [2024-09-20 19:50:29,894 INFO L226 Difference]: Without dead ends: 80 [2024-09-20 19:50:29,896 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 295 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2024-09-20 19:50:29,897 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:29,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-20 19:50:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-09-20 19:50:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-20 19:50:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-20 19:50:29,912 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 136 [2024-09-20 19:50:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:29,912 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-20 19:50:29,913 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 states have internal predecessors, (78), 21 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (35), 17 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-20 19:50:29,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-20 19:50:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-20 19:50:29,916 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:29,916 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:29,928 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-20 19:50:30,117 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:30,117 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:30,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1689956084, now seen corresponding path program 6 times [2024-09-20 19:50:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259049263] [2024-09-20 19:50:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:50:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 19:50:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-20 19:50:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:50:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:50:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:50:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 230 proven. 170 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2024-09-20 19:50:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259049263] [2024-09-20 19:50:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259049263] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087725763] [2024-09-20 19:50:30,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-20 19:50:30,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:30,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:30,442 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-20 19:50:30,510 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-09-20 19:50:30,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:50:30,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-20 19:50:30,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 131 proven. 302 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-09-20 19:50:30,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 131 proven. 337 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-09-20 19:50:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087725763] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:50:31,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:50:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 15] total 23 [2024-09-20 19:50:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369093631] [2024-09-20 19:50:31,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:50:31,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 19:50:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 19:50:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-20 19:50:31,528 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2024-09-20 19:50:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:31,699 INFO L93 Difference]: Finished difference Result 130 states and 184 transitions. [2024-09-20 19:50:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-20 19:50:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) Word has length 136 [2024-09-20 19:50:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:31,700 INFO L225 Difference]: With dead ends: 130 [2024-09-20 19:50:31,700 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:50:31,701 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 296 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2024-09-20 19:50:31,701 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:31,702 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:50:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:50:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:50:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 19:50:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:50:31,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-09-20 19:50:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:31,702 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:50:31,702 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2024-09-20 19:50:31,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:50:31,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:50:31,705 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:50:31,716 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-20 19:50:31,905 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:31,908 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-09-20 19:50:31,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:50:32,789 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:50:32,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:50:32 BoogieIcfgContainer [2024-09-20 19:50:32,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:50:32,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:50:32,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:50:32,805 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:50:32,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:22" (3/4) ... [2024-09-20 19:50:32,807 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:50:32,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:50:32,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:50:32,842 INFO L158 Benchmark]: Toolchain (without parser) took 10449.76ms. Allocated memory was 188.7MB in the beginning and 302.0MB in the end (delta: 113.2MB). Free memory was 126.2MB in the beginning and 161.4MB in the end (delta: -35.2MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,842 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.84ms. Allocated memory is still 188.7MB. Free memory was 125.6MB in the beginning and 156.2MB in the end (delta: -30.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 188.7MB. Free memory was 156.2MB in the beginning and 155.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: Boogie Preprocessor took 33.24ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 154.0MB in the end (delta: 966.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: RCFGBuilder took 205.43ms. Allocated memory is still 188.7MB. Free memory was 154.0MB in the beginning and 141.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: TraceAbstraction took 9944.21ms. Allocated memory was 188.7MB in the beginning and 302.0MB in the end (delta: 113.2MB). Free memory was 141.4MB in the beginning and 163.5MB in the end (delta: -22.1MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,843 INFO L158 Benchmark]: Witness Printer took 36.98ms. Allocated memory is still 302.0MB. Free memory was 163.5MB in the beginning and 161.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:50:32,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.84ms. Allocated memory is still 188.7MB. Free memory was 125.6MB in the beginning and 156.2MB in the end (delta: -30.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 188.7MB. Free memory was 156.2MB in the beginning and 155.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.24ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 154.0MB in the end (delta: 966.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.43ms. Allocated memory is still 188.7MB. Free memory was 154.0MB in the beginning and 141.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9944.21ms. Allocated memory was 188.7MB in the beginning and 302.0MB in the end (delta: 113.2MB). Free memory was 141.4MB in the beginning and 163.5MB in the end (delta: -22.1MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. * Witness Printer took 36.98ms. Allocated memory is still 302.0MB. Free memory was 163.5MB in the beginning and 161.4MB in the end (delta: 2.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: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1270 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1070 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1404 IncrementalHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 200 mSDtfsCounter, 1404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1384 GetRequests, 1209 SyntacticMatches, 26 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=7, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1630 ConstructedInterpolants, 0 QuantifiedInterpolants, 3342 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 5494/8091 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: 7]: Procedure Contract for fibo Derived contract for procedure fibo. Ensures: (((((((((\result == 3) && (4 == \old(n))) || ((2 == \old(n)) && (\result == 1))) || (\old(n) < 1)) || ((3 == \old(n)) && (\result == 2))) || (5 < \old(n))) || ((\result == 1) && (1 == \old(n)))) || ((\result == 5) && (5 == \old(n)))) && ((0 < \old(n)) || (\result == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-20 19:50:32,867 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