./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --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 de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -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 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:35:39,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:35:39,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:35:39,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:35:39,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:35:39,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:35:39,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:35:39,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:35:39,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:35:39,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:35:39,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:35:39,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:35:39,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:35:39,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:35:39,895 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:35:39,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:35:39,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:35:39,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:35:39,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:35:39,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:35:39,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:35:39,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:35:39,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:35:39,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:35:39,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:35:39,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:35:39,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:35:39,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:39,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:35:39,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:35:39,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:35:39,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:35:39,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:35:39,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:35:39,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:35:39,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:35:39,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:35:39,905 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:35:40,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:35:40,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:35:40,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:35:40,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:35:40,167 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:35:40,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-18 15:35:41,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:35:41,808 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:35:41,809 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-18 15:35:41,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/efcd4c639/93406f5c75fd40f2a13bbf41c1eae3cd/FLAG130b71d33 [2024-09-18 15:35:41,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/efcd4c639/93406f5c75fd40f2a13bbf41c1eae3cd [2024-09-18 15:35:41,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:35:41,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:35:41,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:41,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:35:41,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:35:41,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:41" (1/1) ... [2024-09-18 15:35:41,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a10212f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:41, skipping insertion in model container [2024-09-18 15:35:41,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:41" (1/1) ... [2024-09-18 15:35:41,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:35:41,998 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-invgen/SpamAssassin-loop.i[893,906] [2024-09-18 15:35:42,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:42,064 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:35:42,099 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-invgen/SpamAssassin-loop.i[893,906] [2024-09-18 15:35:42,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:42,139 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:35:42,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42 WrapperNode [2024-09-18 15:35:42,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:42,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:42,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:35:42,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:35:42,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,162 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:35:42,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:42,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:35:42,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:35:42,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:35:42,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-18 15:35:42,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:35:42,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:35:42,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:35:42,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:35:42,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (1/1) ... [2024-09-18 15:35:42,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:42,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:35:42,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-18 15:35:42,249 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-18 15:35:42,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:35:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:35:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:35:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:35:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:35:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:35:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:35:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:35:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 15:35:42,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 15:35:42,352 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:35:42,354 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:35:42,500 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-18 15:35:42,500 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:35:42,519 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:35:42,519 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-18 15:35:42,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:42 BoogieIcfgContainer [2024-09-18 15:35:42,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:35:42,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:35:42,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:35:42,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:35:42,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:35:41" (1/3) ... [2024-09-18 15:35:42,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c8ba6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:42, skipping insertion in model container [2024-09-18 15:35:42,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:42" (2/3) ... [2024-09-18 15:35:42,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c8ba6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:42, skipping insertion in model container [2024-09-18 15:35:42,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:42" (3/3) ... [2024-09-18 15:35:42,528 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-09-18 15:35:42,540 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:35:42,540 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 15:35:42,593 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:35:42,601 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75695289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:35:42,601 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 15:35:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-18 15:35:42,615 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:42,615 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:42,616 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:42,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:42,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2120244100, now seen corresponding path program 1 times [2024-09-18 15:35:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668884387] [2024-09-18 15:35:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:42,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:35:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668884387] [2024-09-18 15:35:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668884387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:42,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669097879] [2024-09-18 15:35:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:42,924 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:42,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:42,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:42,953 INFO L87 Difference]: Start difference. First operand has 42 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:43,104 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2024-09-18 15:35:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:35:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-18 15:35:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:43,113 INFO L225 Difference]: With dead ends: 84 [2024-09-18 15:35:43,113 INFO L226 Difference]: Without dead ends: 43 [2024-09-18 15:35:43,116 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:43,119 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:43,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-18 15:35:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-18 15:35:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-18 15:35:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-09-18 15:35:43,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2024-09-18 15:35:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:43,161 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-09-18 15:35:43,161 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:43,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-09-18 15:35:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-18 15:35:43,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:43,164 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:43,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:35:43,164 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:43,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2142200067, now seen corresponding path program 1 times [2024-09-18 15:35:43,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550986124] [2024-09-18 15:35:43,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:35:43,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550986124] [2024-09-18 15:35:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550986124] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:43,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764622761] [2024-09-18 15:35:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:43,299 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:43,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:43,300 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:43,420 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2024-09-18 15:35:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:35:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-18 15:35:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:43,422 INFO L225 Difference]: With dead ends: 56 [2024-09-18 15:35:43,423 INFO L226 Difference]: Without dead ends: 54 [2024-09-18 15:35:43,423 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:43,424 INFO L434 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:43,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-18 15:35:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-09-18 15:35:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-09-18 15:35:43,445 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-09-18 15:35:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:43,455 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-09-18 15:35:43,456 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:43,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-09-18 15:35:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-18 15:35:43,457 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:43,457 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:43,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:35:43,458 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:43,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1866275752, now seen corresponding path program 1 times [2024-09-18 15:35:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283703062] [2024-09-18 15:35:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:35:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283703062] [2024-09-18 15:35:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283703062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:43,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608232113] [2024-09-18 15:35:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:43,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:43,621 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:35:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:43,714 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-09-18 15:35:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:35:43,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-18 15:35:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:43,720 INFO L225 Difference]: With dead ends: 56 [2024-09-18 15:35:43,721 INFO L226 Difference]: Without dead ends: 54 [2024-09-18 15:35:43,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:43,722 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:43,723 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-18 15:35:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-18 15:35:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-09-18 15:35:43,740 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2024-09-18 15:35:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:43,740 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-09-18 15:35:43,740 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:35:43,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-09-18 15:35:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-18 15:35:43,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:43,742 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:43,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-18 15:35:43,742 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:43,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -677095492, now seen corresponding path program 1 times [2024-09-18 15:35:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754769374] [2024-09-18 15:35:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-18 15:35:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:35:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754769374] [2024-09-18 15:35:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754769374] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:43,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68911036] [2024-09-18 15:35:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:43,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:43,867 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 15:35:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:44,002 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-09-18 15:35:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-18 15:35:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:44,005 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:35:44,007 INFO L226 Difference]: Without dead ends: 58 [2024-09-18 15:35:44,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:44,008 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:44,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 176 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-18 15:35:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-18 15:35:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-09-18 15:35:44,029 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2024-09-18 15:35:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:44,030 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-09-18 15:35:44,030 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 15:35:44,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-09-18 15:35:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-18 15:35:44,032 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:44,032 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:44,033 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-18 15:35:44,033 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:44,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 480288744, now seen corresponding path program 1 times [2024-09-18 15:35:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108906517] [2024-09-18 15:35:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-18 15:35:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-18 15:35:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:35:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108906517] [2024-09-18 15:35:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108906517] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:44,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:44,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760262877] [2024-09-18 15:35:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:44,120 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:44,121 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-18 15:35:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:44,206 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-18 15:35:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:35:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-18 15:35:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:44,208 INFO L225 Difference]: With dead ends: 64 [2024-09-18 15:35:44,208 INFO L226 Difference]: Without dead ends: 62 [2024-09-18 15:35:44,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:44,209 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:44,210 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 140 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-18 15:35:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-18 15:35:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-09-18 15:35:44,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2024-09-18 15:35:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:44,224 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-09-18 15:35:44,224 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-18 15:35:44,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-09-18 15:35:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-18 15:35:44,226 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:44,226 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:44,226 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-18 15:35:44,227 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:44,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1289134347, now seen corresponding path program 1 times [2024-09-18 15:35:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521637264] [2024-09-18 15:35:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-18 15:35:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-18 15:35:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-18 15:35:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-18 15:35:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 15:35:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-18 15:35:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521637264] [2024-09-18 15:35:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521637264] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641984625] [2024-09-18 15:35:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:44,356 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:44,357 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:35:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:44,540 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-09-18 15:35:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-09-18 15:35:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:44,542 INFO L225 Difference]: With dead ends: 74 [2024-09-18 15:35:44,542 INFO L226 Difference]: Without dead ends: 72 [2024-09-18 15:35:44,543 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:44,543 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:44,544 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 153 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-18 15:35:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-09-18 15:35:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-18 15:35:44,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2024-09-18 15:35:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:44,565 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-18 15:35:44,565 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:35:44,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-18 15:35:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-18 15:35:44,569 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:44,569 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:44,569 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-18 15:35:44,569 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:44,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1802436875, now seen corresponding path program 1 times [2024-09-18 15:35:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854976139] [2024-09-18 15:35:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-18 15:35:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-18 15:35:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-18 15:35:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-18 15:35:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 15:35:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-18 15:35:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-18 15:35:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-18 15:35:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854976139] [2024-09-18 15:35:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854976139] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095188011] [2024-09-18 15:35:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:44,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:44,688 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-18 15:35:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:44,810 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-09-18 15:35:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2024-09-18 15:35:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:44,812 INFO L225 Difference]: With dead ends: 73 [2024-09-18 15:35:44,813 INFO L226 Difference]: Without dead ends: 71 [2024-09-18 15:35:44,814 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:35:44,814 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:44,815 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-18 15:35:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-18 15:35:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-18 15:35:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-09-18 15:35:44,834 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2024-09-18 15:35:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:44,835 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-09-18 15:35:44,835 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-18 15:35:44,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-09-18 15:35:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-18 15:35:44,837 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:44,837 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:44,837 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-18 15:35:44,837 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:35:44,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash 904022327, now seen corresponding path program 1 times [2024-09-18 15:35:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:44,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840635346] [2024-09-18 15:35:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-18 15:35:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-18 15:35:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:44,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-18 15:35:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-18 15:35:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-18 15:35:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 15:35:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-18 15:35:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-18 15:35:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-18 15:35:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-18 15:35:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-18 15:35:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840635346] [2024-09-18 15:35:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840635346] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-18 15:35:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882710278] [2024-09-18 15:35:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:45,039 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 15:35:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 15:35:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:45,041 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-18 15:35:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:45,180 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-18 15:35:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2024-09-18 15:35:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:45,183 INFO L225 Difference]: With dead ends: 71 [2024-09-18 15:35:45,183 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 15:35:45,184 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-18 15:35:45,185 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:45,186 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 15:35:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 15:35:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-18 15:35:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 15:35:45,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-09-18 15:35:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:45,189 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 15:35:45,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-18 15:35:45,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 15:35:45,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 15:35:45,194 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-18 15:35:45,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-18 15:35:45,198 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:45,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 15:35:45,594 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 15:35:45,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 03:35:45 BoogieIcfgContainer [2024-09-18 15:35:45,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-18 15:35:45,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-18 15:35:45,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-18 15:35:45,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-18 15:35:45,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:42" (3/4) ... [2024-09-18 15:35:45,617 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-18 15:35:45,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-18 15:35:45,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-18 15:35:45,672 INFO L158 Benchmark]: Toolchain (without parser) took 3840.64ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 96.0MB in the beginning and 155.9MB in the end (delta: -59.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:35:45,672 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:35:45,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.51ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 126.0MB in the end (delta: -30.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-18 15:35:45,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.98ms. Allocated memory is still 157.3MB. Free memory was 126.0MB in the beginning and 125.3MB in the end (delta: 705.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:35:45,673 INFO L158 Benchmark]: Boogie Preprocessor took 45.69ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:35:45,673 INFO L158 Benchmark]: RCFGBuilder took 310.29ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 109.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-18 15:35:45,673 INFO L158 Benchmark]: TraceAbstraction took 3092.49ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 108.5MB in the beginning and 158.0MB in the end (delta: -49.5MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-09-18 15:35:45,674 INFO L158 Benchmark]: Witness Printer took 56.30ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:35:45,676 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.51ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 126.0MB in the end (delta: -30.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.98ms. Allocated memory is still 157.3MB. Free memory was 126.0MB in the beginning and 125.3MB in the end (delta: 705.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.69ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.29ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 109.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3092.49ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 108.5MB in the beginning and 158.0MB in the end (delta: -49.5MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * Witness Printer took 56.30ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 903 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 384 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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: 35]: Loop Invariant Derived loop invariant: (((0 <= j) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 56]: Location Invariant Derived location invariant: (((((((long long) i + 1) <= len) && (0 <= j)) && (((long long) 5 + j) <= bufsize)) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= i) && (((long long) limit + 4) <= bufsize)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-18 15:35:45,705 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