./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 ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-ca4ee3d-m [2024-09-20 18:45:19,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 18:45:20,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 18:45:20,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 18:45:20,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 18:45:20,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 18:45:20,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 18:45:20,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 18:45:20,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 18:45:20,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 18:45:20,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 18:45:20,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 18:45:20,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 18:45:20,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 18:45:20,079 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 18:45:20,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 18:45:20,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 18:45:20,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 18:45:20,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 18:45:20,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 18:45:20,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 18:45:20,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 18:45:20,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 18:45:20,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 18:45:20,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 18:45:20,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 18:45:20,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 18:45:20,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:45:20,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 18:45:20,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 18:45:20,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 18:45:20,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 18:45:20,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 18:45:20,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 18:45:20,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 18:45:20,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 18:45:20,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 18:45:20,087 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-20 18:45:20,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 18:45:20,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 18:45:20,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 18:45:20,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 18:45:20,304 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 18:45:20,305 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-20 18:45:21,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 18:45:21,693 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 18:45:21,694 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-20 18:45:21,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8df309275/9fb5d7d6155e48c881e36743f1473432/FLAG29e95493b [2024-09-20 18:45:21,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8df309275/9fb5d7d6155e48c881e36743f1473432 [2024-09-20 18:45:21,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 18:45:21,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 18:45:21,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 18:45:21,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 18:45:21,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 18:45:21,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541cdb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21, skipping insertion in model container [2024-09-20 18:45:21,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 18:45:21,873 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-20 18:45:21,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:45:21,901 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 18:45:21,917 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-20 18:45:21,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 18:45:21,942 INFO L204 MainTranslator]: Completed translation [2024-09-20 18:45:21,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21 WrapperNode [2024-09-20 18:45:21,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 18:45:21,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 18:45:21,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 18:45:21,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 18:45:21,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,961 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 18:45:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 18:45:21,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 18:45:21,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 18:45:21,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 18:45:21,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,990 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 18:45:21,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:21,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 18:45:22,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 18:45:22,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 18:45:22,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 18:45:22,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (1/1) ... [2024-09-20 18:45:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 18:45:22,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 18:45:22,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 18:45:22,027 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 18:45:22,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 18:45:22,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 18:45:22,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 18:45:22,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 18:45:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 18:45:22,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 18:45:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 18:45:22,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 18:45:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 18:45:22,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 18:45:22,113 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 18:45:22,115 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 18:45:22,274 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-20 18:45:22,275 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 18:45:22,297 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 18:45:22,298 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 18:45:22,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:45:22 BoogieIcfgContainer [2024-09-20 18:45:22,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 18:45:22,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 18:45:22,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 18:45:22,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 18:45:22,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 06:45:21" (1/3) ... [2024-09-20 18:45:22,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581cff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:45:22, skipping insertion in model container [2024-09-20 18:45:22,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 06:45:21" (2/3) ... [2024-09-20 18:45:22,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581cff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 06:45:22, skipping insertion in model container [2024-09-20 18:45:22,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:45:22" (3/3) ... [2024-09-20 18:45:22,326 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-09-20 18:45:22,348 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 18:45:22,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 18:45:22,398 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 18:45:22,403 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;@4356b346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 18:45:22,403 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 18:45:22,407 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-20 18:45:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 18:45:22,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:22,413 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:45:22,413 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:22,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2120244100, now seen corresponding path program 1 times [2024-09-20 18:45:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666669298] [2024-09-20 18:45:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:22,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:45:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666669298] [2024-09-20 18:45:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666669298] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:22,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 18:45:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280390446] [2024-09-20 18:45:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:22,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 18:45:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 18:45:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 18:45:22,678 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-20 18:45:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:22,794 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2024-09-20 18:45:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 18:45:22,796 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-20 18:45:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:22,801 INFO L225 Difference]: With dead ends: 84 [2024-09-20 18:45:22,802 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 18:45:22,806 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-20 18:45:22,808 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-20 18:45:22,809 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-20 18:45:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 18:45:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-20 18:45:22,849 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-20 18:45:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-09-20 18:45:22,855 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2024-09-20 18:45:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:22,856 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-09-20 18:45:22,857 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-20 18:45:22,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-09-20 18:45:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 18:45:22,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:22,859 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:45:22,859 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 18:45:22,859 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:22,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2142200067, now seen corresponding path program 1 times [2024-09-20 18:45:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:22,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540657984] [2024-09-20 18:45:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:22,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 18:45:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540657984] [2024-09-20 18:45:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540657984] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 18:45:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522041850] [2024-09-20 18:45:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:22,984 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 18:45:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 18:45:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 18:45:22,985 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-20 18:45:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:23,085 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2024-09-20 18:45:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 18:45:23,086 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-20 18:45:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:23,089 INFO L225 Difference]: With dead ends: 56 [2024-09-20 18:45:23,089 INFO L226 Difference]: Without dead ends: 54 [2024-09-20 18:45:23,090 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-20 18:45:23,091 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-20 18:45:23,092 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-20 18:45:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-20 18:45:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-09-20 18:45:23,108 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-20 18:45:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-09-20 18:45:23,111 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-09-20 18:45:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:23,111 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-09-20 18:45:23,111 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-20 18:45:23,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-09-20 18:45:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 18:45:23,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:23,113 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:45:23,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 18:45:23,114 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:23,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1866275752, now seen corresponding path program 1 times [2024-09-20 18:45:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:23,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176377484] [2024-09-20 18:45:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:23,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,234 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-20 18:45:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:23,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176377484] [2024-09-20 18:45:23,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176377484] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:23,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 18:45:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666406860] [2024-09-20 18:45:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:23,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 18:45:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:23,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 18:45:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 18:45:23,242 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-20 18:45:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:23,325 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-09-20 18:45:23,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 18:45:23,326 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-20 18:45:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:23,328 INFO L225 Difference]: With dead ends: 56 [2024-09-20 18:45:23,329 INFO L226 Difference]: Without dead ends: 54 [2024-09-20 18:45:23,330 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-20 18:45:23,331 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 18:45:23,333 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-20 18:45:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-20 18:45:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-20 18:45:23,346 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-20 18:45:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-09-20 18:45:23,348 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2024-09-20 18:45:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:23,348 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-09-20 18:45:23,349 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-20 18:45:23,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-09-20 18:45:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 18:45:23,350 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:23,350 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-20 18:45:23,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 18:45:23,350 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:23,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -677095492, now seen corresponding path program 1 times [2024-09-20 18:45:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504498347] [2024-09-20 18:45:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:23,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 18:45:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,448 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-20 18:45:23,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:23,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504498347] [2024-09-20 18:45:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504498347] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 18:45:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311954820] [2024-09-20 18:45:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:23,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 18:45:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 18:45:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 18:45:23,454 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-20 18:45:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:23,586 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-09-20 18:45:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:45:23,587 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-20 18:45:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:23,588 INFO L225 Difference]: With dead ends: 60 [2024-09-20 18:45:23,588 INFO L226 Difference]: Without dead ends: 58 [2024-09-20 18:45:23,589 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-20 18:45:23,590 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-20 18:45:23,591 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-20 18:45:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-20 18:45:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-20 18:45:23,600 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-20 18:45:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-09-20 18:45:23,601 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2024-09-20 18:45:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:23,602 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-09-20 18:45:23,602 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-20 18:45:23,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-09-20 18:45:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 18:45:23,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:23,603 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-20 18:45:23,604 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 18:45:23,604 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:23,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 480288744, now seen corresponding path program 1 times [2024-09-20 18:45:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:23,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32973851] [2024-09-20 18:45:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 18:45:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-20 18:45:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,681 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-20 18:45:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32973851] [2024-09-20 18:45:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32973851] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:23,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 18:45:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428735688] [2024-09-20 18:45:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:23,682 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 18:45:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 18:45:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 18:45:23,683 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-20 18:45:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:23,741 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-20 18:45:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 18:45:23,742 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-20 18:45:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:23,743 INFO L225 Difference]: With dead ends: 64 [2024-09-20 18:45:23,743 INFO L226 Difference]: Without dead ends: 62 [2024-09-20 18:45:23,743 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-20 18:45:23,744 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.0s IncrementalHoareTripleChecker+Time [2024-09-20 18:45:23,744 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.0s Time] [2024-09-20 18:45:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-20 18:45:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-20 18:45:23,753 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-20 18:45:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-09-20 18:45:23,754 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2024-09-20 18:45:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:23,754 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-09-20 18:45:23,755 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-20 18:45:23,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-09-20 18:45:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 18:45:23,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:23,756 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-20 18:45:23,756 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 18:45:23,757 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:23,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1289134347, now seen corresponding path program 1 times [2024-09-20 18:45:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450957992] [2024-09-20 18:45:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 18:45:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 18:45:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 18:45:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 18:45:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 18:45:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:23,845 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-20 18:45:23,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:23,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450957992] [2024-09-20 18:45:23,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450957992] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:23,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:23,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 18:45:23,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243505639] [2024-09-20 18:45:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:23,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 18:45:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 18:45:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 18:45:23,847 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-20 18:45:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:23,933 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-09-20 18:45:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 18:45:23,934 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-20 18:45:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:23,936 INFO L225 Difference]: With dead ends: 74 [2024-09-20 18:45:23,936 INFO L226 Difference]: Without dead ends: 72 [2024-09-20 18:45:23,937 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-20 18:45:23,938 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-20 18:45:23,938 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-20 18:45:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-20 18:45:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-09-20 18:45:23,953 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-20 18:45:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-20 18:45:23,954 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2024-09-20 18:45:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:23,955 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-20 18:45:23,955 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-20 18:45:23,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-20 18:45:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-20 18:45:23,957 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:23,957 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-20 18:45:23,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 18:45:23,957 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:23,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1802436875, now seen corresponding path program 1 times [2024-09-20 18:45:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628401406] [2024-09-20 18:45:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 18:45:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 18:45:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 18:45:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 18:45:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 18:45:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 18:45:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-20 18:45:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,066 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-20 18:45:24,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628401406] [2024-09-20 18:45:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628401406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 18:45:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755322179] [2024-09-20 18:45:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:24,070 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 18:45:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 18:45:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-20 18:45:24,071 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-20 18:45:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:24,180 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-09-20 18:45:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 18:45:24,181 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-20 18:45:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:24,182 INFO L225 Difference]: With dead ends: 73 [2024-09-20 18:45:24,182 INFO L226 Difference]: Without dead ends: 71 [2024-09-20 18:45:24,182 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-20 18:45:24,183 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-20 18:45:24,183 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-20 18:45:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-20 18:45:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-20 18:45:24,192 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-20 18:45:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-09-20 18:45:24,193 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2024-09-20 18:45:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:24,194 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-09-20 18:45:24,195 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-20 18:45:24,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-09-20 18:45:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-20 18:45:24,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 18:45:24,198 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-20 18:45:24,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 18:45:24,198 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 18:45:24,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 904022327, now seen corresponding path program 1 times [2024-09-20 18:45:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 18:45:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537597538] [2024-09-20 18:45:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 18:45:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 18:45:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 18:45:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 18:45:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 18:45:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 18:45:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 18:45:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 18:45:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 18:45:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 18:45:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-20 18:45:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-20 18:45:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 18:45:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 18:45:24,324 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-20 18:45:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 18:45:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537597538] [2024-09-20 18:45:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537597538] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 18:45:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 18:45:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 18:45:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84091353] [2024-09-20 18:45:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 18:45:24,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 18:45:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 18:45:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 18:45:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-20 18:45:24,330 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-20 18:45:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 18:45:24,448 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-20 18:45:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 18:45:24,448 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-20 18:45:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 18:45:24,449 INFO L225 Difference]: With dead ends: 71 [2024-09-20 18:45:24,449 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 18:45:24,449 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-20 18:45:24,450 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-20 18:45:24,450 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-20 18:45:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 18:45:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 18:45:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 18:45:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 18:45:24,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-09-20 18:45:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 18:45:24,451 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 18:45:24,451 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-20 18:45:24,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 18:45:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 18:45:24,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 18:45:24,454 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 18:45:24,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 18:45:24,456 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 18:45:24,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 18:45:24,743 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 18:45:24,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 06:45:24 BoogieIcfgContainer [2024-09-20 18:45:24,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 18:45:24,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 18:45:24,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 18:45:24,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 18:45:24,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 06:45:22" (3/4) ... [2024-09-20 18:45:24,765 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 18:45:24,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 18:45:24,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 18:45:24,814 INFO L158 Benchmark]: Toolchain (without parser) took 3082.98ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 93.5MB in the beginning and 150.9MB in the end (delta: -57.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,814 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 18:45:24,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.23ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 81.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.34ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 18:45:24,814 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 151.0MB. Free memory was 80.2MB in the beginning and 78.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,815 INFO L158 Benchmark]: RCFGBuilder took 298.95ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 64.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,815 INFO L158 Benchmark]: TraceAbstraction took 2442.30ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 120.7MB in the beginning and 153.0MB in the end (delta: -32.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,815 INFO L158 Benchmark]: Witness Printer took 49.99ms. Allocated memory is still 213.9MB. Free memory was 153.0MB in the beginning and 150.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 18:45:24,817 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 151.0MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.23ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 81.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.34ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 151.0MB. Free memory was 80.2MB in the beginning and 78.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.95ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 64.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2442.30ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 120.7MB in the beginning and 153.0MB in the end (delta: -32.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 49.99ms. Allocated memory is still 213.9MB. Free memory was 153.0MB in the beginning and 150.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.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.4s 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, 0.8s 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-20 18:45:24,840 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