./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label30.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1f76deb0aac2d13590c7cb3a6148c4325e466ac4c549b73efe913c295ef834bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:06:28,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:06:28,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:06:28,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:06:28,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:06:28,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:06:28,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:06:28,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:06:28,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:06:28,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:06:28,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:06:28,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:06:28,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:06:28,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:06:28,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:06:28,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:06:28,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:06:28,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:06:28,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:06:28,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:06:28,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:06:28,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:06:28,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:06:28,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:06:28,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:06:28,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:06:28,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:06:28,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:06:28,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:06:28,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:06:28,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:06:28,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:06:28,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:06:28,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:06:28,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:06:28,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:06:28,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:06:28,858 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1f76deb0aac2d13590c7cb3a6148c4325e466ac4c549b73efe913c295ef834bc [2024-11-16 03:06:29,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:06:29,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:06:29,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:06:29,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:06:29,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:06:29,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label30.c [2024-11-16 03:06:30,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:06:30,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:06:30,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label30.c [2024-11-16 03:06:30,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dd323c9/208f63e81c904a1ba58cd9fe4197f068/FLAG859287aaf [2024-11-16 03:06:30,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dd323c9/208f63e81c904a1ba58cd9fe4197f068 [2024-11-16 03:06:30,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:06:30,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:06:30,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:06:30,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:06:30,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:06:30,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:06:30" (1/1) ... [2024-11-16 03:06:30,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d9e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:30, skipping insertion in model container [2024-11-16 03:06:30,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:06:30" (1/1) ... [2024-11-16 03:06:30,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:06:31,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label30.c[19968,19981] [2024-11-16 03:06:31,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:06:31,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:06:31,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label30.c[19968,19981] [2024-11-16 03:06:31,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:06:31,302 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:06:31,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31 WrapperNode [2024-11-16 03:06:31,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:06:31,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:06:31,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:06:31,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:06:31,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,360 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-16 03:06:31,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:06:31,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:06:31,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:06:31,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:06:31,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,403 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-11-16 03:06:31,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:06:31,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:06:31,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:06:31,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:06:31,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (1/1) ... [2024-11-16 03:06:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:06:31,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:06:31,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:06:31,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:06:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:06:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:06:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:06:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:06:31,570 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:06:31,571 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:06:32,288 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:06:32,289 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:06:32,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:06:32,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:06:32,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:06:32 BoogieIcfgContainer [2024-11-16 03:06:32,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:06:32,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:06:32,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:06:32,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:06:32,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:06:30" (1/3) ... [2024-11-16 03:06:32,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46088436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:06:32, skipping insertion in model container [2024-11-16 03:06:32,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:06:31" (2/3) ... [2024-11-16 03:06:32,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46088436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:06:32, skipping insertion in model container [2024-11-16 03:06:32,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:06:32" (3/3) ... [2024-11-16 03:06:32,316 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label30.c [2024-11-16 03:06:32,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:06:32,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:06:32,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:06:32,397 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7f79726d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:06:32,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:06:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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-11-16 03:06:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 03:06:32,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:32,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:32,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:32,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1892517222, now seen corresponding path program 1 times [2024-11-16 03:06:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377360523] [2024-11-16 03:06:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377360523] [2024-11-16 03:06:32,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377360523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:32,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:06:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107866293] [2024-11-16 03:06:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:32,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:32,920 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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) Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-11-16 03:06:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:33,524 INFO L93 Difference]: Finished difference Result 602 states and 1036 transitions. [2024-11-16 03:06:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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) Word has length 130 [2024-11-16 03:06:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:33,534 INFO L225 Difference]: With dead ends: 602 [2024-11-16 03:06:33,534 INFO L226 Difference]: Without dead ends: 308 [2024-11-16 03:06:33,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:06:33,538 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 116 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:33,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 93 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:06:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-16 03:06:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-16 03:06:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 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-11-16 03:06:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2024-11-16 03:06:33,584 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 130 [2024-11-16 03:06:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:33,585 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2024-11-16 03:06:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-11-16 03:06:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2024-11-16 03:06:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 03:06:33,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:33,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:33,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:06:33,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -440950735, now seen corresponding path program 1 times [2024-11-16 03:06:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314306327] [2024-11-16 03:06:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:33,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314306327] [2024-11-16 03:06:33,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314306327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:33,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:33,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:06:33,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784960608] [2024-11-16 03:06:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:33,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:33,792 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-11-16 03:06:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:34,178 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2024-11-16 03:06:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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) Word has length 142 [2024-11-16 03:06:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:34,185 INFO L225 Difference]: With dead ends: 911 [2024-11-16 03:06:34,186 INFO L226 Difference]: Without dead ends: 605 [2024-11-16 03:06:34,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:06:34,187 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:34,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 75 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:06:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-16 03:06:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2024-11-16 03:06:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4733333333333334) internal successors, (884), 600 states have internal predecessors, (884), 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-11-16 03:06:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 884 transitions. [2024-11-16 03:06:34,218 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 884 transitions. Word has length 142 [2024-11-16 03:06:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:34,218 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 884 transitions. [2024-11-16 03:06:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-11-16 03:06:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 884 transitions. [2024-11-16 03:06:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 03:06:34,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:34,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:34,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:06:34,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1252019211, now seen corresponding path program 1 times [2024-11-16 03:06:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:34,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897107702] [2024-11-16 03:06:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 03:06:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:34,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897107702] [2024-11-16 03:06:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897107702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:06:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731528762] [2024-11-16 03:06:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:34,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:34,363 INFO L87 Difference]: Start difference. First operand 601 states and 884 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-11-16 03:06:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:34,539 INFO L93 Difference]: Finished difference Result 1049 states and 1550 transitions. [2024-11-16 03:06:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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) Word has length 147 [2024-11-16 03:06:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:34,541 INFO L225 Difference]: With dead ends: 1049 [2024-11-16 03:06:34,541 INFO L226 Difference]: Without dead ends: 450 [2024-11-16 03:06:34,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:06:34,542 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:34,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 25 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:06:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-16 03:06:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-16 03:06:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 449 states have internal predecessors, (638), 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-11-16 03:06:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 638 transitions. [2024-11-16 03:06:34,555 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 638 transitions. Word has length 147 [2024-11-16 03:06:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 638 transitions. [2024-11-16 03:06:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-11-16 03:06:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 638 transitions. [2024-11-16 03:06:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 03:06:34,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:34,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:34,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:06:34,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2003559938, now seen corresponding path program 1 times [2024-11-16 03:06:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:34,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43382869] [2024-11-16 03:06:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43382869] [2024-11-16 03:06:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43382869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:06:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724312259] [2024-11-16 03:06:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:34,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:34,689 INFO L87 Difference]: Start difference. First operand 450 states and 638 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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-11-16 03:06:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:35,001 INFO L93 Difference]: Finished difference Result 1338 states and 1900 transitions. [2024-11-16 03:06:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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) Word has length 149 [2024-11-16 03:06:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:35,004 INFO L225 Difference]: With dead ends: 1338 [2024-11-16 03:06:35,004 INFO L226 Difference]: Without dead ends: 890 [2024-11-16 03:06:35,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:06:35,009 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 149 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:35,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 89 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-16 03:06:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 882. [2024-11-16 03:06:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.3700340522133938) internal successors, (1207), 881 states have internal predecessors, (1207), 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-11-16 03:06:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1207 transitions. [2024-11-16 03:06:35,024 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1207 transitions. Word has length 149 [2024-11-16 03:06:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:35,024 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1207 transitions. [2024-11-16 03:06:35,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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-11-16 03:06:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1207 transitions. [2024-11-16 03:06:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 03:06:35,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:35,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:06:35,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2136475272, now seen corresponding path program 1 times [2024-11-16 03:06:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477647933] [2024-11-16 03:06:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477647933] [2024-11-16 03:06:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477647933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:06:35,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999399190] [2024-11-16 03:06:35,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:35,084 INFO L87 Difference]: Start difference. First operand 882 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-11-16 03:06:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:35,394 INFO L93 Difference]: Finished difference Result 2611 states and 3578 transitions. [2024-11-16 03:06:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:35,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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) Word has length 153 [2024-11-16 03:06:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:35,399 INFO L225 Difference]: With dead ends: 2611 [2024-11-16 03:06:35,400 INFO L226 Difference]: Without dead ends: 1731 [2024-11-16 03:06:35,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:06:35,404 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:35,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 67 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2024-11-16 03:06:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1449. [2024-11-16 03:06:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1448 states have (on average 1.308011049723757) internal successors, (1894), 1448 states have internal predecessors, (1894), 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-11-16 03:06:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1894 transitions. [2024-11-16 03:06:35,428 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1894 transitions. Word has length 153 [2024-11-16 03:06:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:35,428 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1894 transitions. [2024-11-16 03:06:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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-11-16 03:06:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1894 transitions. [2024-11-16 03:06:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-16 03:06:35,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:35,432 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:35,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:06:35,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:35,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2038353342, now seen corresponding path program 1 times [2024-11-16 03:06:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:35,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113164672] [2024-11-16 03:06:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113164672] [2024-11-16 03:06:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113164672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:35,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:06:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094486720] [2024-11-16 03:06:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:35,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:35,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:35,536 INFO L87 Difference]: Start difference. First operand 1449 states and 1894 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-11-16 03:06:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:35,889 INFO L93 Difference]: Finished difference Result 3741 states and 4871 transitions. [2024-11-16 03:06:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:35,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) Word has length 154 [2024-11-16 03:06:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:35,896 INFO L225 Difference]: With dead ends: 3741 [2024-11-16 03:06:35,897 INFO L226 Difference]: Without dead ends: 2294 [2024-11-16 03:06:35,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-16 03:06:35,899 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 138 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:35,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 76 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2024-11-16 03:06:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2024-11-16 03:06:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2307021369385085) internal successors, (2822), 2293 states have internal predecessors, (2822), 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-11-16 03:06:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2822 transitions. [2024-11-16 03:06:35,929 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2822 transitions. Word has length 154 [2024-11-16 03:06:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2822 transitions. [2024-11-16 03:06:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-11-16 03:06:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2822 transitions. [2024-11-16 03:06:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 03:06:35,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:35,934 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:06:35,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1404738258, now seen corresponding path program 1 times [2024-11-16 03:06:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687397902] [2024-11-16 03:06:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:35,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687397902] [2024-11-16 03:06:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687397902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:06:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883781413] [2024-11-16 03:06:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:06:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:06:36,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:06:36,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:06:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:36,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:06:36,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:06:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:06:36,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:06:36,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883781413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:36,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:06:36,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:06:36,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288855869] [2024-11-16 03:06:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:36,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:36,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:36,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:06:36,503 INFO L87 Difference]: Start difference. First operand 2294 states and 2822 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-11-16 03:06:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:36,838 INFO L93 Difference]: Finished difference Result 4586 states and 5642 transitions. [2024-11-16 03:06:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:36,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) Word has length 159 [2024-11-16 03:06:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:36,844 INFO L225 Difference]: With dead ends: 4586 [2024-11-16 03:06:36,844 INFO L226 Difference]: Without dead ends: 2294 [2024-11-16 03:06:36,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:06:36,847 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:36,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 216 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2024-11-16 03:06:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2024-11-16 03:06:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.156127344090711) internal successors, (2651), 2293 states have internal predecessors, (2651), 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-11-16 03:06:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2651 transitions. [2024-11-16 03:06:36,874 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2651 transitions. Word has length 159 [2024-11-16 03:06:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2651 transitions. [2024-11-16 03:06:36,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-11-16 03:06:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2651 transitions. [2024-11-16 03:06:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 03:06:36,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:36,878 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:36,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 03:06:37,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:06:37,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -588467717, now seen corresponding path program 1 times [2024-11-16 03:06:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271519579] [2024-11-16 03:06:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 03:06:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271519579] [2024-11-16 03:06:37,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271519579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:06:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284621540] [2024-11-16 03:06:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:37,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:37,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:37,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:06:37,179 INFO L87 Difference]: Start difference. First operand 2294 states and 2651 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-16 03:06:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:37,511 INFO L93 Difference]: Finished difference Result 4863 states and 5606 transitions. [2024-11-16 03:06:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) Word has length 188 [2024-11-16 03:06:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:37,516 INFO L225 Difference]: With dead ends: 4863 [2024-11-16 03:06:37,516 INFO L226 Difference]: Without dead ends: 2003 [2024-11-16 03:06:37,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-16 03:06:37,520 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:37,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 42 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2024-11-16 03:06:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2003. [2024-11-16 03:06:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 1.1108891108891108) internal successors, (2224), 2002 states have internal predecessors, (2224), 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-11-16 03:06:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2224 transitions. [2024-11-16 03:06:37,565 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2224 transitions. Word has length 188 [2024-11-16 03:06:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:37,565 INFO L471 AbstractCegarLoop]: Abstraction has 2003 states and 2224 transitions. [2024-11-16 03:06:37,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-16 03:06:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2224 transitions. [2024-11-16 03:06:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 03:06:37,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:37,569 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:37,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:06:37,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash 64442929, now seen corresponding path program 1 times [2024-11-16 03:06:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90963667] [2024-11-16 03:06:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 03:06:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90963667] [2024-11-16 03:06:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90963667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:06:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378546269] [2024-11-16 03:06:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:06:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:37,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:06:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:06:37,804 INFO L87 Difference]: Start difference. First operand 2003 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-11-16 03:06:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:38,380 INFO L93 Difference]: Finished difference Result 4281 states and 4754 transitions. [2024-11-16 03:06:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:06:38,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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) Word has length 192 [2024-11-16 03:06:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:38,385 INFO L225 Difference]: With dead ends: 4281 [2024-11-16 03:06:38,385 INFO L226 Difference]: Without dead ends: 2280 [2024-11-16 03:06:38,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:06:38,387 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 325 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:38,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 90 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:06:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2024-11-16 03:06:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1857. [2024-11-16 03:06:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.113146551724138) internal successors, (2066), 1856 states have internal predecessors, (2066), 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-11-16 03:06:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2066 transitions. [2024-11-16 03:06:38,409 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2066 transitions. Word has length 192 [2024-11-16 03:06:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:38,409 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2066 transitions. [2024-11-16 03:06:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-11-16 03:06:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2066 transitions. [2024-11-16 03:06:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 03:06:38,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:38,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:38,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:06:38,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:38,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash -168310637, now seen corresponding path program 1 times [2024-11-16 03:06:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62524463] [2024-11-16 03:06:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:38,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:38,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62524463] [2024-11-16 03:06:38,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62524463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:38,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:06:38,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:06:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434817327] [2024-11-16 03:06:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:38,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:06:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:06:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:06:38,659 INFO L87 Difference]: Start difference. First operand 1857 states and 2066 transitions. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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-11-16 03:06:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:39,015 INFO L93 Difference]: Finished difference Result 3858 states and 4288 transitions. [2024-11-16 03:06:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:06:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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) Word has length 199 [2024-11-16 03:06:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:39,021 INFO L225 Difference]: With dead ends: 3858 [2024-11-16 03:06:39,022 INFO L226 Difference]: Without dead ends: 2003 [2024-11-16 03:06:39,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:06:39,024 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 101 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:39,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 85 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2024-11-16 03:06:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1998. [2024-11-16 03:06:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 1.1071607411116675) internal successors, (2211), 1997 states have internal predecessors, (2211), 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-11-16 03:06:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2211 transitions. [2024-11-16 03:06:39,047 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2211 transitions. Word has length 199 [2024-11-16 03:06:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:39,048 INFO L471 AbstractCegarLoop]: Abstraction has 1998 states and 2211 transitions. [2024-11-16 03:06:39,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 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-11-16 03:06:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2211 transitions. [2024-11-16 03:06:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 03:06:39,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:06:39,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:39,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:06:39,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:06:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:06:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1322548309, now seen corresponding path program 1 times [2024-11-16 03:06:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:06:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273391426] [2024-11-16 03:06:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:06:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:06:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:06:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273391426] [2024-11-16 03:06:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273391426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:06:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523780983] [2024-11-16 03:06:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:06:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:06:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:06:39,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:06:39,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:06:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:06:39,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:06:39,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:06:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 03:06:39,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:06:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523780983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:06:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:06:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:06:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564531291] [2024-11-16 03:06:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:06:39,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:06:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:06:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:06:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:06:39,578 INFO L87 Difference]: Start difference. First operand 1998 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-11-16 03:06:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:06:39,869 INFO L93 Difference]: Finished difference Result 4698 states and 5254 transitions. [2024-11-16 03:06:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:06:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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) Word has length 230 [2024-11-16 03:06:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:06:39,871 INFO L225 Difference]: With dead ends: 4698 [2024-11-16 03:06:39,871 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:06:39,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:06:39,874 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:06:39,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 178 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:06:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:06:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:06:39,875 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-11-16 03:06:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:06:39,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2024-11-16 03:06:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:06:39,876 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:06:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-11-16 03:06:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:06:39,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:06:39,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:06:39,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:06:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 03:06:40,083 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:06:40,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:06:40,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:06:40,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:06:40 BoogieIcfgContainer [2024-11-16 03:06:40,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:06:40,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:06:40,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:06:40,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:06:40,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:06:32" (3/4) ... [2024-11-16 03:06:40,266 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:06:40,282 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:06:40,282 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:06:40,283 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:06:40,284 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:06:40,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:06:40,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:06:40,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:06:40,392 INFO L158 Benchmark]: Toolchain (without parser) took 9577.16ms. Allocated memory was 169.9MB in the beginning and 308.3MB in the end (delta: 138.4MB). Free memory was 99.8MB in the beginning and 158.3MB in the end (delta: -58.5MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,392 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:06:40,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.00ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 120.2MB in the end (delta: -20.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.41ms. Allocated memory is still 169.9MB. Free memory was 120.2MB in the beginning and 114.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,393 INFO L158 Benchmark]: Boogie Preprocessor took 79.80ms. Allocated memory is still 169.9MB. Free memory was 114.6MB in the beginning and 110.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,393 INFO L158 Benchmark]: IcfgBuilder took 866.99ms. Allocated memory is still 169.9MB. Free memory was 110.4MB in the beginning and 116.5MB in the end (delta: -6.1MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,393 INFO L158 Benchmark]: TraceAbstraction took 7953.45ms. Allocated memory was 169.9MB in the beginning and 308.3MB in the end (delta: 138.4MB). Free memory was 115.7MB in the beginning and 170.9MB in the end (delta: -55.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,393 INFO L158 Benchmark]: Witness Printer took 127.54ms. Allocated memory is still 308.3MB. Free memory was 170.9MB in the beginning and 158.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:06:40,394 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.14ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.00ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 120.2MB in the end (delta: -20.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.41ms. Allocated memory is still 169.9MB. Free memory was 120.2MB in the beginning and 114.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.80ms. Allocated memory is still 169.9MB. Free memory was 114.6MB in the beginning and 110.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 866.99ms. Allocated memory is still 169.9MB. Free memory was 110.4MB in the beginning and 116.5MB in the end (delta: -6.1MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7953.45ms. Allocated memory was 169.9MB in the beginning and 308.3MB in the end (delta: 138.4MB). Free memory was 115.7MB in the beginning and 170.9MB in the end (delta: -55.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Witness Printer took 127.54ms. Allocated memory is still 308.3MB. Free memory was 170.9MB in the beginning and 158.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 566]: 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 1 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1593 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1593 mSDsluCounter, 1036 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 555 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4402 IncrementalHoareTripleChecker+Invalid, 4957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 555 mSolverCounterUnsat, 850 mSDtfsCounter, 4402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2294occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 722 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2232 NumberOfCodeBlocks, 2232 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 8352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 616/694 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: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:06:40,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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