./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:27:32,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:27:32,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:27:32,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:27:32,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:27:32,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:27:32,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:27:32,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:27:32,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:27:32,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:27:32,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:27:32,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:27:32,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:27:32,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:27:32,571 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:27:32,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:27:32,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:27:32,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:27:32,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:27:32,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:27:32,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:27:32,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:27:32,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:27:32,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:27:32,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:27:32,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:27:32,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:27:32,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:27:32,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:27:32,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:27:32,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:27:32,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:27:32,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:27:32,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:27:32,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:27:32,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:27:32,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:27:32,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:27:32,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:27:32,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:27:32,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:27:32,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:27:32,584 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 11:27:32,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:27:32,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:27:32,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:27:32,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:27:32,958 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:27:32,959 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-25 11:27:34,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:27:34,598 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:27:34,599 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_5-1.c [2024-09-25 11:27:34,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/05527bf31/c114c55bb9b24da3854cb87e73018356/FLAG6caaeebd7 [2024-09-25 11:27:34,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/05527bf31/c114c55bb9b24da3854cb87e73018356 [2024-09-25 11:27:34,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:27:34,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:27:34,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:27:34,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:27:34,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:27:34,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3a318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34, skipping insertion in model container [2024-09-25 11:27:34,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:27:34,791 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-25 11:27:34,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:27:34,807 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:27:34,822 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-25 11:27:34,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:27:34,847 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:27:34,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34 WrapperNode [2024-09-25 11:27:34,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:27:34,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:27:34,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:27:34,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:27:34,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,870 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:27:34,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:27:34,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:27:34,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:27:34,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:27:34,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,912 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-25 11:27:34,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:27:34,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:27:34,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:27:34,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:27:34,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (1/1) ... [2024-09-25 11:27:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:27:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:34,955 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-25 11:27:34,961 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-25 11:27:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:27:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:27:35,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:27:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:27:35,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:27:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:27:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:27:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:27:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-09-25 11:27:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-09-25 11:27:35,071 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:27:35,073 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:27:35,208 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:27:35,208 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:27:35,238 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:27:35,239 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:27:35,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:35 BoogieIcfgContainer [2024-09-25 11:27:35,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:27:35,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:27:35,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:27:35,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:27:35,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:27:34" (1/3) ... [2024-09-25 11:27:35,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e91f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:27:35, skipping insertion in model container [2024-09-25 11:27:35,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:34" (2/3) ... [2024-09-25 11:27:35,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e91f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:27:35, skipping insertion in model container [2024-09-25 11:27:35,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:35" (3/3) ... [2024-09-25 11:27:35,250 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2024-09-25 11:27:35,267 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:27:35,267 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:27:35,338 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:27:35,345 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;@6de230d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:27:35,346 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:27:35,349 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-25 11:27:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:27:35,356 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:35,356 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:35,357 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:35,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 358193300, now seen corresponding path program 1 times [2024-09-25 11:27:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:35,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559641925] [2024-09-25 11:27:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:35,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:35,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:35,663 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-25 11:27:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559641925] [2024-09-25 11:27:35,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559641925] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:35,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:35,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:27:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288951610] [2024-09-25 11:27:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:35,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:35,712 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-25 11:27:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:35,813 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-25 11:27:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:35,815 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-25 11:27:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:35,823 INFO L225 Difference]: With dead ends: 35 [2024-09-25 11:27:35,824 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 11:27:35,827 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-25 11:27:35,833 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:35,834 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.1s Time] [2024-09-25 11:27:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 11:27:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-25 11:27:35,876 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-25 11:27:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-25 11:27:35,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2024-09-25 11:27:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:35,882 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-25 11:27:35,883 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-25 11:27:35,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-25 11:27:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 11:27:35,895 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:35,895 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:35,896 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:27:35,897 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:35,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1069801351, now seen corresponding path program 1 times [2024-09-25 11:27:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294364361] [2024-09-25 11:27:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:35,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:35,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,038 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-25 11:27:36,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294364361] [2024-09-25 11:27:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294364361] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:27:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854647942] [2024-09-25 11:27:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:36,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:36,043 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-25 11:27:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:36,105 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-09-25 11:27:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:36,106 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-25 11:27:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:36,107 INFO L225 Difference]: With dead ends: 27 [2024-09-25 11:27:36,107 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 11:27:36,107 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-25 11:27:36,108 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:36,109 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.1s Time] [2024-09-25 11:27:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 11:27:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-25 11:27:36,118 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-25 11:27:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-25 11:27:36,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2024-09-25 11:27:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:36,121 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-25 11:27:36,121 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-25 11:27:36,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-25 11:27:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 11:27:36,124 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:36,124 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-25 11:27:36,124 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:27:36,124 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:36,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash -648535868, now seen corresponding path program 1 times [2024-09-25 11:27:36,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:36,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318865269] [2024-09-25 11:27:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:27:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,346 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-25 11:27:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318865269] [2024-09-25 11:27:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318865269] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812670613] [2024-09-25 11:27:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:36,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:36,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:36,352 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-25 11:27:36,354 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-25 11:27:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:36,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:27:36,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:36,505 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-25 11:27:36,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:36,782 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-25 11:27:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812670613] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:36,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-09-25 11:27:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757326680] [2024-09-25 11:27:36,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:36,783 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:27:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:27:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:27:36,785 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-25 11:27:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:36,904 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-25 11:27:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:27:36,904 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-25 11:27:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:36,906 INFO L225 Difference]: With dead ends: 38 [2024-09-25 11:27:36,906 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 11:27:36,907 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-25 11:27:36,909 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:36,910 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.1s Time] [2024-09-25 11:27:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 11:27:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-25 11:27:36,920 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-25 11:27:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-25 11:27:36,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2024-09-25 11:27:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:36,923 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-25 11:27:36,923 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-25 11:27:36,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-25 11:27:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:27:36,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:36,926 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-25 11:27:36,944 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 11:27:37,127 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-25 11:27:37,128 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:37,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1169471199, now seen corresponding path program 1 times [2024-09-25 11:27:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:37,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985739807] [2024-09-25 11:27:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,327 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-25 11:27:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985739807] [2024-09-25 11:27:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985739807] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:37,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120572223] [2024-09-25 11:27:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:37,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:37,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:37,335 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-25 11:27:37,338 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-25 11:27:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:37,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:27:37,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:37,427 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-25 11:27:37,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:37,634 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-25 11:27:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120572223] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:37,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:37,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-09-25 11:27:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565626901] [2024-09-25 11:27:37,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:37,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:27:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:27:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:27:37,637 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-25 11:27:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:37,747 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-25 11:27:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:27:37,748 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-25 11:27:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:37,750 INFO L225 Difference]: With dead ends: 41 [2024-09-25 11:27:37,750 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 11:27:37,752 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-25 11:27:37,753 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-25 11:27:37,753 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-25 11:27:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 11:27:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-25 11:27:37,767 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-25 11:27:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-09-25 11:27:37,770 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2024-09-25 11:27:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:37,771 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-09-25 11:27:37,771 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-25 11:27:37,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-09-25 11:27:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 11:27:37,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:37,773 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-25 11:27:37,787 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:27:37,973 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-25 11:27:37,974 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:37,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 413055705, now seen corresponding path program 2 times [2024-09-25 11:27:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292637686] [2024-09-25 11:27:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:38,160 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-25 11:27:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292637686] [2024-09-25 11:27:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292637686] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915037405] [2024-09-25 11:27:38,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:27:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:38,164 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-25 11:27:38,165 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-25 11:27:38,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:27:38,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:38,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:27:38,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:38,312 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-25 11:27:38,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:38,691 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-25 11:27:38,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915037405] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:38,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-09-25 11:27:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066902479] [2024-09-25 11:27:38,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:38,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 11:27:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 11:27:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:27:38,696 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-25 11:27:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:38,867 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2024-09-25 11:27:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:27:38,868 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-25 11:27:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:38,869 INFO L225 Difference]: With dead ends: 72 [2024-09-25 11:27:38,869 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 11:27:38,870 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-25 11:27:38,871 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:38,871 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:27:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 11:27:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-25 11:27:38,881 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-25 11:27:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-09-25 11:27:38,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2024-09-25 11:27:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:38,885 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-09-25 11:27:38,885 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-25 11:27:38,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-09-25 11:27:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 11:27:38,890 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:38,890 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-25 11:27:38,907 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:27:39,094 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-25 11:27:39,095 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:39,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash -926093039, now seen corresponding path program 3 times [2024-09-25 11:27:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:39,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048578371] [2024-09-25 11:27:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:39,422 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-25 11:27:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048578371] [2024-09-25 11:27:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048578371] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632421715] [2024-09-25 11:27:39,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:27:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:39,427 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-25 11:27:39,429 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-25 11:27:39,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-25 11:27:39,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:39,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:27:39,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:39,536 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-25 11:27:39,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:39,859 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-25 11:27:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632421715] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:39,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 15 [2024-09-25 11:27:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498036720] [2024-09-25 11:27:39,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:39,860 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 11:27:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:39,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 11:27:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:27:39,862 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-25 11:27:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:40,015 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2024-09-25 11:27:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:27:40,016 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-25 11:27:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:40,019 INFO L225 Difference]: With dead ends: 83 [2024-09-25 11:27:40,019 INFO L226 Difference]: Without dead ends: 79 [2024-09-25 11:27:40,019 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-25 11:27:40,020 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-25 11:27:40,020 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-25 11:27:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-25 11:27:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-09-25 11:27:40,037 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-25 11:27:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-09-25 11:27:40,039 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2024-09-25 11:27:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:40,039 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-09-25 11:27:40,040 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-25 11:27:40,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-09-25 11:27:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-25 11:27:40,043 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:40,043 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-25 11:27:40,060 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:27:40,243 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-25 11:27:40,244 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:40,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -257182465, now seen corresponding path program 4 times [2024-09-25 11:27:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235347344] [2024-09-25 11:27:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:40,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:40,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:40,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:40,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:40,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:41,180 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-25 11:27:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235347344] [2024-09-25 11:27:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235347344] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960677557] [2024-09-25 11:27:41,181 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 11:27:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:41,184 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-25 11:27:41,185 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-25 11:27:41,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 11:27:41,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:41,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 11:27:41,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:41,432 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-25 11:27:41,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:41,869 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-25 11:27:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960677557] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:41,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 20 [2024-09-25 11:27:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695137230] [2024-09-25 11:27:41,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:41,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:27:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:27:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:27:41,871 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-25 11:27:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:42,079 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-09-25 11:27:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:27:42,081 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-25 11:27:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:42,088 INFO L225 Difference]: With dead ends: 135 [2024-09-25 11:27:42,088 INFO L226 Difference]: Without dead ends: 131 [2024-09-25 11:27:42,089 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-09-25 11:27:42,089 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, 6 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:42,089 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 504 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:27:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-25 11:27:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2024-09-25 11:27:42,123 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-25 11:27:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-09-25 11:27:42,125 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 109 [2024-09-25 11:27:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:42,126 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-09-25 11:27:42,126 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-25 11:27:42,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-09-25 11:27:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-25 11:27:42,129 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:42,129 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-25 11:27:42,149 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 11:27:42,330 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-25 11:27:42,330 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:42,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash 994115606, now seen corresponding path program 5 times [2024-09-25 11:27:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:42,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008871796] [2024-09-25 11:27:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:42,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:42,901 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-25 11:27:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008871796] [2024-09-25 11:27:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008871796] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177928130] [2024-09-25 11:27:42,902 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 11:27:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:42,904 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-25 11:27:42,905 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-25 11:27:42,976 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-09-25 11:27:42,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:42,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 11:27:42,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:43,099 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-25 11:27:43,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:44,194 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-25 11:27:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177928130] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:44,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 17] total 29 [2024-09-25 11:27:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114341795] [2024-09-25 11:27:44,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:44,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-25 11:27:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-25 11:27:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:27:44,198 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-25 11:27:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:44,492 INFO L93 Difference]: Finished difference Result 154 states and 259 transitions. [2024-09-25 11:27:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 11:27:44,493 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-25 11:27:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:44,495 INFO L225 Difference]: With dead ends: 154 [2024-09-25 11:27:44,495 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 11:27:44,500 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 295 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 11:27:44,501 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:44,501 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.2s Time] [2024-09-25 11:27:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 11:27:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-09-25 11:27:44,513 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-25 11:27:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-25 11:27:44,514 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 136 [2024-09-25 11:27:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:44,515 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-25 11:27:44,515 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-25 11:27:44,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-25 11:27:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-25 11:27:44,518 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:44,518 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-25 11:27:44,531 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 11:27:44,718 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-25 11:27:44,719 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:44,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1689956084, now seen corresponding path program 6 times [2024-09-25 11:27:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621442415] [2024-09-25 11:27:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:44,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:44,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:44,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:44,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,063 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-25 11:27:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:45,170 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-25 11:27:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621442415] [2024-09-25 11:27:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621442415] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953452634] [2024-09-25 11:27:45,171 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 11:27:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:45,173 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-25 11:27:45,175 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-25 11:27:45,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-09-25 11:27:45,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:45,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:27:45,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:45,362 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-25 11:27:45,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:46,597 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-25 11:27:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953452634] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:46,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 15] total 23 [2024-09-25 11:27:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451619899] [2024-09-25 11:27:46,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:46,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 11:27:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 11:27:46,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:27:46,600 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-25 11:27:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:46,820 INFO L93 Difference]: Finished difference Result 130 states and 184 transitions. [2024-09-25 11:27:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:27:46,821 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-25 11:27:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:46,822 INFO L225 Difference]: With dead ends: 130 [2024-09-25 11:27:46,822 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:27:46,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 296 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2024-09-25 11:27:46,824 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:46,824 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.2s Time] [2024-09-25 11:27:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:27:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:27:46,825 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-25 11:27:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:27:46,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-09-25 11:27:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:46,827 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:27:46,827 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-25 11:27:46,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:27:46,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:27:46,830 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:27:46,848 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 11:27:47,031 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-25 11:27:47,035 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-09-25 11:27:47,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:27:48,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:27:48,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,238 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,238 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,238 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,240 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,240 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:27:48 BoogieIcfgContainer [2024-09-25 11:27:48,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:27:48,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:27:48,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:27:48,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:27:48,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:35" (3/4) ... [2024-09-25 11:27:48,244 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:27:48,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:27:48,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:27:48,295 INFO L158 Benchmark]: Toolchain (without parser) took 13665.31ms. Allocated memory was 56.6MB in the beginning and 176.2MB in the end (delta: 119.5MB). Free memory was 34.7MB in the beginning and 64.4MB in the end (delta: -29.6MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,295 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:27:48,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.95ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 23.7MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.51ms. Allocated memory is still 56.6MB. Free memory was 23.5MB in the beginning and 22.5MB in the end (delta: 960.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:27:48,296 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 22.5MB in the beginning and 49.7MB in the end (delta: -27.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,296 INFO L158 Benchmark]: RCFGBuilder took 317.93ms. Allocated memory is still 69.2MB. Free memory was 49.7MB in the beginning and 38.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,297 INFO L158 Benchmark]: TraceAbstraction took 12997.81ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 37.9MB in the beginning and 67.5MB in the end (delta: -29.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,297 INFO L158 Benchmark]: Witness Printer took 52.92ms. Allocated memory is still 176.2MB. Free memory was 66.5MB in the beginning and 64.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,298 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.16ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.95ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 23.7MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.51ms. Allocated memory is still 56.6MB. Free memory was 23.5MB in the beginning and 22.5MB in the end (delta: 960.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.43ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 22.5MB in the beginning and 49.7MB in the end (delta: -27.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 317.93ms. Allocated memory is still 69.2MB. Free memory was 49.7MB in the beginning and 38.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12997.81ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 37.9MB in the beginning and 67.5MB in the end (delta: -29.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Witness Printer took 52.92ms. Allocated memory is still 176.2MB. Free memory was 66.5MB in the beginning and 64.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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 11.7s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1270 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1070 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1409 IncrementalHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 200 mSDtfsCounter, 1409 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.4s 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.3s SatisfiabilityAnalysisTime, 7.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 == n)) || ((2 == n) && (\result == 1))) || (n < 1)) || ((3 == n) && (\result == 2))) || (5 < n)) || ((\result == 1) && (1 == n))) || ((\result == 5) && (5 == n))) && ((0 < n) || (\result == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:27:48,329 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE