./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:31:22,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:31:22,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:31:22,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:31:22,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:31:22,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:31:22,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:31:22,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:31:22,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:31:22,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:31:22,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:31:22,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:31:22,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:31:22,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:31:22,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:31:22,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:31:22,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:31:22,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:31:22,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:31:22,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:31:22,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:31:22,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:31:22,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:31:22,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:31:22,819 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:31:22,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:31:22,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:31:22,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:31:22,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:31:22,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:31:22,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:31:22,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:31:22,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:31:22,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:31:22,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:31:22,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:31:22,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:31:22,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:31:22,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:31:22,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:31:22,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:31:22,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:31:22,825 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:31:23,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:31:23,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:31:23,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:31:23,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:31:23,143 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:31:23,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_4.c [2024-10-15 14:31:24,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:31:24,772 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:31:24,773 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_4.c [2024-10-15 14:31:24,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a53355dda/72c438932a8648eabf00fd0a737fa894/FLAG03257dc4e [2024-10-15 14:31:24,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a53355dda/72c438932a8648eabf00fd0a737fa894 [2024-10-15 14:31:24,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:31:24,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:31:24,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:31:24,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:31:24,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:31:24,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:31:24" (1/1) ... [2024-10-15 14:31:24,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3345edb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:24, skipping insertion in model container [2024-10-15 14:31:24,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:31:24" (1/1) ... [2024-10-15 14:31:24,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:31:25,009 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/loop-simple/nested_4.c[841,854] [2024-10-15 14:31:25,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:31:25,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:31:25,040 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/loop-simple/nested_4.c[841,854] [2024-10-15 14:31:25,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:31:25,056 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:31:25,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25 WrapperNode [2024-10-15 14:31:25,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:31:25,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:31:25,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:31:25,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:31:25,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,095 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:31:25,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:31:25,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:31:25,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:31:25,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:31:25,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:31:25,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:31:25,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:31:25,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:31:25,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:31:25,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (1/1) ... [2024-10-15 14:31:25,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:31:25,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:25,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:31:25,193 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:31:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:31:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:31:25,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:31:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:31:25,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:31:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:31:25,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:31:25,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:31:25,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:31:25,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:31:25,488 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-15 14:31:25,489 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:31:25,511 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:31:25,511 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-15 14:31:25,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:25 BoogieIcfgContainer [2024-10-15 14:31:25,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:31:25,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:31:25,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:31:25,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:31:25,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:31:24" (1/3) ... [2024-10-15 14:31:25,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cb6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:31:25, skipping insertion in model container [2024-10-15 14:31:25,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:25" (2/3) ... [2024-10-15 14:31:25,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cb6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:31:25, skipping insertion in model container [2024-10-15 14:31:25,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:25" (3/3) ... [2024-10-15 14:31:25,524 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_4.c [2024-10-15 14:31:25,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:31:25,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:31:25,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:31:25,591 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ca60ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:31:25,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:31:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:31:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-15 14:31:25,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:25,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:25,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1429086249, now seen corresponding path program 1 times [2024-10-15 14:31:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14660380] [2024-10-15 14:31:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14660380] [2024-10-15 14:31:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14660380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:31:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586218367] [2024-10-15 14:31:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:31:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:25,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:31:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:31:25,808 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:25,833 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2024-10-15 14:31:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:31:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-15 14:31:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:25,843 INFO L225 Difference]: With dead ends: 33 [2024-10-15 14:31:25,843 INFO L226 Difference]: Without dead ends: 15 [2024-10-15 14:31:25,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:31:25,849 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:25,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-15 14:31:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 14:31:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-15 14:31:25,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2024-10-15 14:31:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-15 14:31:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-15 14:31:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-15 14:31:25,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:25,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:31:25,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:25,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1429126611, now seen corresponding path program 1 times [2024-10-15 14:31:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967488770] [2024-10-15 14:31:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967488770] [2024-10-15 14:31:26,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967488770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:26,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:26,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787261425] [2024-10-15 14:31:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:26,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,029 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:26,067 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-15 14:31:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:26,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-15 14:31:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:26,069 INFO L225 Difference]: With dead ends: 25 [2024-10-15 14:31:26,071 INFO L226 Difference]: Without dead ends: 22 [2024-10-15 14:31:26,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,073 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:26,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-15 14:31:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2024-10-15 14:31:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-15 14:31:26,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2024-10-15 14:31:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 14:31:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-10-15 14:31:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:31:26,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:26,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:26,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:31:26,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 921905310, now seen corresponding path program 1 times [2024-10-15 14:31:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703280770] [2024-10-15 14:31:26,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703280770] [2024-10-15 14:31:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703280770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:26,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:26,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912538246] [2024-10-15 14:31:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,182 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:26,218 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-10-15 14:31:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-15 14:31:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:26,219 INFO L225 Difference]: With dead ends: 31 [2024-10-15 14:31:26,220 INFO L226 Difference]: Without dead ends: 21 [2024-10-15 14:31:26,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,221 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:26,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-15 14:31:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-10-15 14:31:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-15 14:31:26,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-10-15 14:31:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:26,231 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 14:31:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-15 14:31:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:31:26,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:26,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:26,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:31:26,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:26,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1474006703, now seen corresponding path program 1 times [2024-10-15 14:31:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471028497] [2024-10-15 14:31:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471028497] [2024-10-15 14:31:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471028497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472701327] [2024-10-15 14:31:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,314 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:26,344 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-15 14:31:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-15 14:31:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:26,345 INFO L225 Difference]: With dead ends: 31 [2024-10-15 14:31:26,345 INFO L226 Difference]: Without dead ends: 20 [2024-10-15 14:31:26,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,347 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:26,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-15 14:31:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-15 14:31:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-15 14:31:26,356 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2024-10-15 14:31:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:26,356 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 14:31:26,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-15 14:31:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:31:26,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:26,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:26,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:31:26,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash -518581990, now seen corresponding path program 1 times [2024-10-15 14:31:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:26,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475937130] [2024-10-15 14:31:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475937130] [2024-10-15 14:31:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475937130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648879866] [2024-10-15 14:31:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,453 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:26,474 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-10-15 14:31:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-15 14:31:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:26,476 INFO L225 Difference]: With dead ends: 31 [2024-10-15 14:31:26,476 INFO L226 Difference]: Without dead ends: 19 [2024-10-15 14:31:26,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:26,477 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:26,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-15 14:31:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-15 14:31:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-15 14:31:26,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2024-10-15 14:31:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:26,487 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-15 14:31:26,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-15 14:31:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-15 14:31:26,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:26,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:26,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:31:26,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1881243200, now seen corresponding path program 1 times [2024-10-15 14:31:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:26,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447231947] [2024-10-15 14:31:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447231947] [2024-10-15 14:31:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447231947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401598828] [2024-10-15 14:31:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:26,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:26,566 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:31:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 14:31:26,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401598828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:26,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 14:31:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175717577] [2024-10-15 14:31:26,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:31:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:31:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:26,711 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:26,740 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-10-15 14:31:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:31:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-15 14:31:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:26,742 INFO L225 Difference]: With dead ends: 35 [2024-10-15 14:31:26,742 INFO L226 Difference]: Without dead ends: 22 [2024-10-15 14:31:26,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:26,743 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:26,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-15 14:31:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-15 14:31:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-15 14:31:26,754 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2024-10-15 14:31:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:26,754 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-15 14:31:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-15 14:31:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:31:26,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:26,755 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:26,775 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:31:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:31:26,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:26,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 264309402, now seen corresponding path program 2 times [2024-10-15 14:31:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913368909] [2024-10-15 14:31:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 14:31:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913368909] [2024-10-15 14:31:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913368909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9722174] [2024-10-15 14:31:27,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:31:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:27,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:27,054 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:31:27,099 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:31:27,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:27,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 14:31:27,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:27,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9722174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:27,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:27,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-10-15 14:31:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087536432] [2024-10-15 14:31:27,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:27,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:31:27,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:31:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:31:27,229 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:27,410 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-10-15 14:31:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-15 14:31:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-15 14:31:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:27,411 INFO L225 Difference]: With dead ends: 57 [2024-10-15 14:31:27,411 INFO L226 Difference]: Without dead ends: 41 [2024-10-15 14:31:27,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:31:27,413 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 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-10-15 14:31:27,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:31:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-15 14:31:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-10-15 14:31:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-15 14:31:27,422 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2024-10-15 14:31:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-15 14:31:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-15 14:31:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:31:27,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:27,427 INFO L215 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:27,440 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:31:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:31:27,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 795945841, now seen corresponding path program 3 times [2024-10-15 14:31:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303213611] [2024-10-15 14:31:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-15 14:31:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303213611] [2024-10-15 14:31:27,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303213611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030933126] [2024-10-15 14:31:27,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:31:27,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:27,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:27,710 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:31:27,753 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-15 14:31:27,753 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:27,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 14:31:27,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-15 14:31:27,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-15 14:31:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030933126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:27,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-15 14:31:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905189897] [2024-10-15 14:31:27,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:31:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:31:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:31:27,892 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:28,054 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2024-10-15 14:31:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:31:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-10-15 14:31:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:28,059 INFO L225 Difference]: With dead ends: 296 [2024-10-15 14:31:28,059 INFO L226 Difference]: Without dead ends: 269 [2024-10-15 14:31:28,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:31:28,060 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:28,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 49 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:31:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-15 14:31:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2024-10-15 14:31:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.1567567567567567) internal successors, (214), 185 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 217 transitions. [2024-10-15 14:31:28,109 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 217 transitions. Word has length 32 [2024-10-15 14:31:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:28,109 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 217 transitions. [2024-10-15 14:31:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2024-10-15 14:31:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-15 14:31:28,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:28,115 INFO L215 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:31:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-15 14:31:28,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 524786029, now seen corresponding path program 4 times [2024-10-15 14:31:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294327078] [2024-10-15 14:31:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-10-15 14:31:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294327078] [2024-10-15 14:31:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294327078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399400411] [2024-10-15 14:31:28,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:31:28,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:28,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:28,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:28,633 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:31:28,760 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:31:28,760 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:28,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:31:28,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-10-15 14:31:28,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-10-15 14:31:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399400411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:28,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-15 14:31:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141894443] [2024-10-15 14:31:28,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:28,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:31:28,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:31:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:28,893 INFO L87 Difference]: Start difference. First operand 189 states and 217 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:29,017 INFO L93 Difference]: Finished difference Result 640 states and 757 transitions. [2024-10-15 14:31:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:31:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 188 [2024-10-15 14:31:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:29,021 INFO L225 Difference]: With dead ends: 640 [2024-10-15 14:31:29,021 INFO L226 Difference]: Without dead ends: 477 [2024-10-15 14:31:29,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:29,023 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:29,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-15 14:31:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-10-15 14:31:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 473 states have (on average 1.1289640591966172) internal successors, (534), 473 states have internal predecessors, (534), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 537 transitions. [2024-10-15 14:31:29,109 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 537 transitions. Word has length 188 [2024-10-15 14:31:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 537 transitions. [2024-10-15 14:31:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 537 transitions. [2024-10-15 14:31:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-10-15 14:31:29,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:29,129 INFO L215 NwaCegarLoop]: trace histogram [288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:29,148 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:31:29,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:29,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -295793811, now seen corresponding path program 5 times [2024-10-15 14:31:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203830050] [2024-10-15 14:31:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 22231 proven. 1853 refuted. 0 times theorem prover too weak. 34974 trivial. 0 not checked. [2024-10-15 14:31:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203830050] [2024-10-15 14:31:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203830050] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:29,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441001156] [2024-10-15 14:31:29,875 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 14:31:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:29,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:29,880 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:31:30,058 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2024-10-15 14:31:30,058 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:30,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:31:30,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-10-15 14:31:30,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-10-15 14:31:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441001156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:30,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-15 14:31:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465311930] [2024-10-15 14:31:30,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:31:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:31:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:30,464 INFO L87 Difference]: Start difference. First operand 477 states and 537 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:30,662 INFO L93 Difference]: Finished difference Result 1745 states and 1978 transitions. [2024-10-15 14:31:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:31:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 476 [2024-10-15 14:31:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:30,671 INFO L225 Difference]: With dead ends: 1745 [2024-10-15 14:31:30,671 INFO L226 Difference]: Without dead ends: 1389 [2024-10-15 14:31:30,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:30,675 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:30,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-10-15 14:31:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1389. [2024-10-15 14:31:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1385 states have (on average 1.1249097472924188) internal successors, (1558), 1385 states have internal predecessors, (1558), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1561 transitions. [2024-10-15 14:31:30,860 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1561 transitions. Word has length 476 [2024-10-15 14:31:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:30,861 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1561 transitions. [2024-10-15 14:31:30,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1561 transitions. [2024-10-15 14:31:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1389 [2024-10-15 14:31:30,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:30,919 INFO L215 NwaCegarLoop]: trace histogram [864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:30,938 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 14:31:31,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:31:31,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2030357395, now seen corresponding path program 6 times [2024-10-15 14:31:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856506926] [2024-10-15 14:31:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 0 proven. 399910 refuted. 0 times theorem prover too weak. 132612 trivial. 0 not checked. [2024-10-15 14:31:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856506926] [2024-10-15 14:31:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856506926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845644993] [2024-10-15 14:31:33,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 14:31:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:33,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:33,714 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:31:34,841 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 233 check-sat command(s) [2024-10-15 14:31:34,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:34,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 14:31:34,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 209210 proven. 792 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-10-15 14:31:35,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 199954 proven. 10048 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-10-15 14:31:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845644993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:37,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 21] total 43 [2024-10-15 14:31:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541398903] [2024-10-15 14:31:37,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:37,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-15 14:31:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-15 14:31:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2024-10-15 14:31:37,940 INFO L87 Difference]: Start difference. First operand 1389 states and 1561 transitions. Second operand has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:40,505 INFO L93 Difference]: Finished difference Result 3413 states and 3841 transitions. [2024-10-15 14:31:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-15 14:31:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 1388 [2024-10-15 14:31:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:40,517 INFO L225 Difference]: With dead ends: 3413 [2024-10-15 14:31:40,517 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:31:40,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2879 GetRequests, 2743 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5663 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2980, Invalid=15926, Unknown=0, NotChecked=0, Total=18906 [2024-10-15 14:31:40,532 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 155 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:40,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 144 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:31:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:31:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:31:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:31:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:31:40,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1388 [2024-10-15 14:31:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:40,537 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:31:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:31:40,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:31:40,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:31:40,560 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 14:31:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 14:31:40,744 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-10-15 14:31:40,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:33:02,465 WARN L286 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 1746 DAG size of output: 1554 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-15 14:33:52,546 WARN L286 SmtUtils]: Spent 47.03s on a formula simplification. DAG size of input: 1554 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-15 14:33:52,667 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:33:52,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:33:52 BoogieIcfgContainer [2024-10-15 14:33:52,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:33:52,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:33:52,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:33:52,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:33:52,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:25" (3/4) ... [2024-10-15 14:33:52,692 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:33:52,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:33:52,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:33:52,744 INFO L158 Benchmark]: Toolchain (without parser) took 147945.84ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 99.0MB in the beginning and 462.8MB in the end (delta: -363.7MB). Peak memory consumption was 590.4MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,744 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 75.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:33:52,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.20ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 86.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 167.8MB. Free memory was 86.8MB in the beginning and 140.7MB in the end (delta: -53.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,745 INFO L158 Benchmark]: Boogie Preprocessor took 54.72ms. Allocated memory is still 167.8MB. Free memory was 140.7MB in the beginning and 138.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,745 INFO L158 Benchmark]: RCFGBuilder took 356.73ms. Allocated memory is still 167.8MB. Free memory was 138.8MB in the beginning and 127.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,745 INFO L158 Benchmark]: TraceAbstraction took 147174.76ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 126.2MB in the beginning and 464.9MB in the end (delta: -338.7MB). Peak memory consumption was 690.1MB. Max. memory is 16.1GB. [2024-10-15 14:33:52,746 INFO L158 Benchmark]: Witness Printer took 53.32ms. Allocated memory is still 1.1GB. Free memory was 464.9MB in the beginning and 462.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:33:52,747 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.25ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 75.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.20ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 86.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 167.8MB. Free memory was 86.8MB in the beginning and 140.7MB in the end (delta: -53.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.72ms. Allocated memory is still 167.8MB. Free memory was 140.7MB in the beginning and 138.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.73ms. Allocated memory is still 167.8MB. Free memory was 138.8MB in the beginning and 127.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 147174.76ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 126.2MB in the beginning and 464.9MB in the end (delta: -338.7MB). Peak memory consumption was 690.1MB. Max. memory is 16.1GB. * Witness Printer took 53.32ms. Allocated memory is still 1.1GB. Free memory was 464.9MB in the beginning and 462.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 864, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 156 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4424 GetRequests, 4227 SyntacticMatches, 4 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5801 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1389occurred in iteration=10, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 100 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4304 NumberOfCodeBlocks, 3408 NumberOfCodeBlocksAsserted, 300 NumberOfCheckSat, 6404 ConstructedInterpolants, 0 QuantifiedInterpolants, 13420 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3265 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 1378759/1795254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((b == 6) && (c == 6)) && (a <= 6)) && (d == 6)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((((((((b <= 5) && (5 == c)) && (d == 1)) && (a <= 5)) || ((((b <= 5) && (d == 3)) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 1))) || ((((d == 4) && (b <= 5)) && (5 == c)) && (a <= 5))) || ((((d == 0) && (b <= 5)) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || ((((b <= 5) && (5 == c)) && (d == 2)) && (a <= 5))) || (((b <= 5) && (c == 0)) && (a <= 5))) || ((((b <= 5) && (5 == c)) && (d == 6)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) || ((((b <= 5) && (5 == c)) && (5 == d)) && (a <= 5))) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((b <= 5) && (a <= 5)) && (c == 1)) || (((b <= 5) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || ((((c == 6) && (b <= 5)) && (d == 6)) && (a <= 5))) || (((b <= 5) && (c == 0)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((c == 6) && (b <= 6)) && (d == 6)) && (a <= 5)) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:33:52,778 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