./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex1b.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 f1d7dc9d 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-lit/hh2012-ex1b.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 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --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-f1d7dc9-m [2024-09-20 12:03:48,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:03:48,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:03:48,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:03:48,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:03:48,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:03:48,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:03:48,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:03:48,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:03:48,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:03:48,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:03:48,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:03:48,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:03:48,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:03:48,519 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:03:48,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:03:48,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:03:48,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:03:48,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:03:48,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:03:48,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:03:48,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:03:48,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:03:48,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:03:48,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:03:48,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:03:48,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:03:48,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:03:48,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:03:48,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:03:48,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:03:48,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:03:48,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:03:48,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:03:48,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:03:48,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:03:48,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:03:48,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:03:48,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:03:48,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:03:48,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:03:48,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:03:48,532 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 -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 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 12:03:48,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:03:48,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:03:48,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:03:48,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:03:48,864 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:03:48,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-09-20 12:03:50,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:03:50,460 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:03:50,462 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-09-20 12:03:50,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6b2a77008/9db1743461b54274ad5788be7473db74/FLAG40713d482 [2024-09-20 12:03:50,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6b2a77008/9db1743461b54274ad5788be7473db74 [2024-09-20 12:03:50,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:03:50,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:03:50,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:03:50,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:03:50,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:03:50,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2120ec96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50, skipping insertion in model container [2024-09-20 12:03:50,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:03:50,687 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-lit/hh2012-ex1b.i[800,813] [2024-09-20 12:03:50,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:03:50,705 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:03:50,716 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-lit/hh2012-ex1b.i[800,813] [2024-09-20 12:03:50,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:03:50,738 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:03:50,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50 WrapperNode [2024-09-20 12:03:50,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:03:50,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:03:50,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:03:50,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:03:50,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,763 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:03:50,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:03:50,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:03:50,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:03:50,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:03:50,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,786 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 12:03:50,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:03:50,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:03:50,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:03:50,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:03:50,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (1/1) ... [2024-09-20 12:03:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:03:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:03:50,831 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 12:03:50,842 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 12:03:50,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:03:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:03:50,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:03:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:03:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:03:50,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:03:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:03:50,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:03:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:03:50,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:03:50,952 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:03:50,955 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:03:51,100 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-20 12:03:51,101 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:03:51,127 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:03:51,127 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:03:51,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:51 BoogieIcfgContainer [2024-09-20 12:03:51,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:03:51,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:03:51,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:03:51,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:03:51,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:03:50" (1/3) ... [2024-09-20 12:03:51,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457e5c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:03:51, skipping insertion in model container [2024-09-20 12:03:51,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:03:50" (2/3) ... [2024-09-20 12:03:51,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457e5c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:03:51, skipping insertion in model container [2024-09-20 12:03:51,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:51" (3/3) ... [2024-09-20 12:03:51,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex1b.i [2024-09-20 12:03:51,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:03:51,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:03:51,239 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:03:51,245 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;@79462ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:03:51,246 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:03:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 12:03:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 12:03:51,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:51,257 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:51,258 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:51,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1987115305, now seen corresponding path program 1 times [2024-09-20 12:03:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583061153] [2024-09-20 12:03:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,399 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 12:03:51,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583061153] [2024-09-20 12:03:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583061153] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:51,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:03:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406174850] [2024-09-20 12:03:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:51,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:03:51,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:03:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:03:51,424 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 12:03:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:51,446 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2024-09-20 12:03:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:03:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2024-09-20 12:03:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:51,453 INFO L225 Difference]: With dead ends: 41 [2024-09-20 12:03:51,453 INFO L226 Difference]: Without dead ends: 19 [2024-09-20 12:03:51,455 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:03:51,458 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:51,459 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-20 12:03:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-20 12:03:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 12:03:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-20 12:03:51,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2024-09-20 12:03:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:51,488 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-20 12:03:51,488 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 12:03:51,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-20 12:03:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 12:03:51,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:51,490 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:51,490 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:03:51,490 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:51,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2006509246, now seen corresponding path program 1 times [2024-09-20 12:03:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795656745] [2024-09-20 12:03:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,583 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 12:03:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:51,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795656745] [2024-09-20 12:03:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795656745] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:03:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083564604] [2024-09-20 12:03:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:51,585 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:03:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:03:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:03:51,591 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 12:03:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:51,623 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-09-20 12:03:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:03:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2024-09-20 12:03:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:51,629 INFO L225 Difference]: With dead ends: 31 [2024-09-20 12:03:51,629 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 12:03:51,631 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:03:51,634 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:51,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 12:03:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-09-20 12:03:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 12:03:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-20 12:03:51,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2024-09-20 12:03:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:51,645 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-20 12:03:51,645 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 12:03:51,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-20 12:03:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:03:51,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:51,646 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:51,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:03:51,647 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:51,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2049576433, now seen corresponding path program 1 times [2024-09-20 12:03:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065293177] [2024-09-20 12:03:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,707 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 12:03:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065293177] [2024-09-20 12:03:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065293177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:03:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340301708] [2024-09-20 12:03:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:51,709 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:03:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:03:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:03:51,714 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 12:03:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:51,729 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-20 12:03:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:03:51,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2024-09-20 12:03:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:51,731 INFO L225 Difference]: With dead ends: 35 [2024-09-20 12:03:51,731 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 12:03:51,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:03:51,733 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:51,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 12:03:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 12:03:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 12:03:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 12:03:51,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2024-09-20 12:03:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:51,742 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 12:03:51,742 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 12:03:51,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 12:03:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:03:51,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:51,743 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:51,744 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:03:51,744 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:51,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2047788973, now seen corresponding path program 1 times [2024-09-20 12:03:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591971549] [2024-09-20 12:03:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:51,888 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 12:03:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591971549] [2024-09-20 12:03:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591971549] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942848760] [2024-09-20 12:03:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:51,889 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:51,893 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 12:03:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:51,949 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-09-20 12:03:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2024-09-20 12:03:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:51,952 INFO L225 Difference]: With dead ends: 42 [2024-09-20 12:03:51,952 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 12:03:51,953 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 12:03:51,954 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:51,954 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 12:03:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 12:03:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 12:03:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-20 12:03:51,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2024-09-20 12:03:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:51,962 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-20 12:03:51,962 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 12:03:51,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-20 12:03:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 12:03:51,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:51,963 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:51,964 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:03:51,964 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:51,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2117333063, now seen corresponding path program 1 times [2024-09-20 12:03:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736347175] [2024-09-20 12:03:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:03:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736347175] [2024-09-20 12:03:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736347175] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:52,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:03:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165371681] [2024-09-20 12:03:52,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:52,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:03:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:03:52,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:03:52,043 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:03:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:52,152 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-09-20 12:03:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:03:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-20 12:03:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:52,153 INFO L225 Difference]: With dead ends: 33 [2024-09-20 12:03:52,153 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 12:03:52,153 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 12:03:52,154 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:52,154 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:03:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 12:03:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-20 12:03:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 12:03:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-20 12:03:52,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2024-09-20 12:03:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:52,166 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-20 12:03:52,166 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 12:03:52,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-20 12:03:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 12:03:52,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:52,167 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:52,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 12:03:52,167 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:52,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1129932041, now seen corresponding path program 1 times [2024-09-20 12:03:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:52,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435602244] [2024-09-20 12:03:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 12:03:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-20 12:03:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435602244] [2024-09-20 12:03:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435602244] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260390035] [2024-09-20 12:03:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:52,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:52,304 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 12:03:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:52,360 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-09-20 12:03:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 12:03:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:52,362 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:03:52,362 INFO L226 Difference]: Without dead ends: 35 [2024-09-20 12:03:52,362 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:52,363 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:52,363 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-20 12:03:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-20 12:03:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 12:03:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-09-20 12:03:52,369 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2024-09-20 12:03:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:52,369 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-09-20 12:03:52,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 12:03:52,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-09-20 12:03:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 12:03:52,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:52,370 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:52,370 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:03:52,370 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:52,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash 588634027, now seen corresponding path program 1 times [2024-09-20 12:03:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:52,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383995979] [2024-09-20 12:03:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 12:03:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-20 12:03:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-20 12:03:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383995979] [2024-09-20 12:03:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383995979] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:52,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:52,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623509349] [2024-09-20 12:03:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:52,475 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:52,476 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 12:03:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:52,534 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-09-20 12:03:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 29 [2024-09-20 12:03:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:52,535 INFO L225 Difference]: With dead ends: 63 [2024-09-20 12:03:52,536 INFO L226 Difference]: Without dead ends: 56 [2024-09-20 12:03:52,536 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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 12:03:52,537 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:52,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-20 12:03:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-09-20 12:03:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 12:03:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-20 12:03:52,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 29 [2024-09-20 12:03:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:52,552 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-20 12:03:52,552 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 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 12:03:52,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-20 12:03:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-20 12:03:52,554 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:52,555 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:52,555 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 12:03:52,556 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:52,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 336281732, now seen corresponding path program 1 times [2024-09-20 12:03:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188505710] [2024-09-20 12:03:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 12:03:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-20 12:03:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 12:03:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-20 12:03:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-20 12:03:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-09-20 12:03:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188505710] [2024-09-20 12:03:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188505710] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:03:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283132535] [2024-09-20 12:03:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:52,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:03:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:03:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:03:52,674 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 12:03:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:52,710 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-09-20 12:03:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:03:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-09-20 12:03:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:52,711 INFO L225 Difference]: With dead ends: 55 [2024-09-20 12:03:52,711 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 12:03:52,711 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 12:03:52,712 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:52,712 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 12:03:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-20 12:03:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 12:03:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-09-20 12:03:52,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 55 [2024-09-20 12:03:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:52,727 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-09-20 12:03:52,728 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 12:03:52,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-09-20 12:03:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-20 12:03:52,729 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:03:52,729 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:52,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 12:03:52,729 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:03:52,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1400378896, now seen corresponding path program 1 times [2024-09-20 12:03:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:03:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188454930] [2024-09-20 12:03:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:03:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:03:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:03:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 12:03:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 12:03:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-20 12:03:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 12:03:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:03:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-20 12:03:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-20 12:03:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-20 12:03:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:03:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-09-20 12:03:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:03:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188454930] [2024-09-20 12:03:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188454930] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:03:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:03:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 12:03:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667312503] [2024-09-20 12:03:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:03:52,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:03:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:03:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:03:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:03:52,846 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 12:03:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:03:52,889 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-09-20 12:03:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 12:03:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2024-09-20 12:03:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:03:52,890 INFO L225 Difference]: With dead ends: 51 [2024-09-20 12:03:52,890 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:03:52,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:03:52,891 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:03:52,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:03:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:03:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:03:52,892 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 12:03:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:03:52,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-09-20 12:03:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:03:52,894 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:03:52,894 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 12:03:52,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:03:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:03:52,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:03:52,897 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:03:52,898 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-20 12:03:52,900 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:03:52,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:03:53,029 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:03:53,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:03:53 BoogieIcfgContainer [2024-09-20 12:03:53,045 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:03:53,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:03:53,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:03:53,046 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:03:53,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:03:51" (3/4) ... [2024-09-20 12:03:53,048 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:03:53,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:03:53,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:03:53,100 INFO L158 Benchmark]: Toolchain (without parser) took 2609.66ms. Allocated memory was 134.2MB in the beginning and 228.6MB in the end (delta: 94.4MB). Free memory was 64.4MB in the beginning and 80.6MB in the end (delta: -16.2MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,100 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:03:53,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.66ms. Allocated memory was 134.2MB in the beginning and 228.6MB in the end (delta: 94.4MB). Free memory was 64.3MB in the beginning and 193.8MB in the end (delta: -129.6MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.55ms. Allocated memory is still 228.6MB. Free memory was 193.8MB in the beginning and 192.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:03:53,101 INFO L158 Benchmark]: Boogie Preprocessor took 29.86ms. Allocated memory is still 228.6MB. Free memory was 192.8MB in the beginning and 191.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,101 INFO L158 Benchmark]: RCFGBuilder took 332.93ms. Allocated memory is still 228.6MB. Free memory was 191.7MB in the beginning and 179.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,101 INFO L158 Benchmark]: TraceAbstraction took 1911.79ms. Allocated memory is still 228.6MB. Free memory was 179.2MB in the beginning and 82.7MB in the end (delta: 96.5MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,102 INFO L158 Benchmark]: Witness Printer took 51.97ms. Allocated memory is still 228.6MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:03:53,103 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.17ms. Allocated memory is still 134.2MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.66ms. Allocated memory was 134.2MB in the beginning and 228.6MB in the end (delta: 94.4MB). Free memory was 64.3MB in the beginning and 193.8MB in the end (delta: -129.6MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.55ms. Allocated memory is still 228.6MB. Free memory was 193.8MB in the beginning and 192.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.86ms. Allocated memory is still 228.6MB. Free memory was 192.8MB in the beginning and 191.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.93ms. Allocated memory is still 228.6MB. Free memory was 191.7MB in the beginning and 179.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1911.79ms. Allocated memory is still 228.6MB. Free memory was 179.2MB in the beginning and 82.7MB in the end (delta: 96.5MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 51.97ms. Allocated memory is still 228.6MB. Free memory was 82.7MB in the beginning and 80.6MB 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: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 173 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 317/317 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: 16]: Loop Invariant Derived loop invariant: (i < 101) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((i <= 99) && (j <= 100)) - ProcedureContractResult [Line: 13]: 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 12:03:53,131 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