./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label17.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6848db2ddd2556f2093bbcb0368e7a4f47fdd5c1a9995f9fb65bc5fd459ece0d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:57:33,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:57:33,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:57:33,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:57:33,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:57:33,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:57:33,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:57:33,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:57:33,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:57:33,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:57:33,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:57:33,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:57:33,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:57:33,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:57:33,447 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:57:33,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:57:33,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:57:33,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:57:33,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:57:33,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:57:33,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:57:33,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:57:33,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:57:33,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:57:33,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:57:33,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:57:33,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:57:33,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:57:33,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:57:33,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:57:33,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:57:33,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:57:33,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:57:33,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:57:33,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:57:33,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:57:33,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:57:33,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:57:33,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:57:33,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:57:33,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:57:33,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:57:33,456 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-clean/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-clean/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 -> 6848db2ddd2556f2093bbcb0368e7a4f47fdd5c1a9995f9fb65bc5fd459ece0d [2024-10-10 23:57:33,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:57:33,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:57:33,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:57:33,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:57:33,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:57:33,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label17.c [2024-10-10 23:57:35,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:57:35,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:57:35,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label17.c [2024-10-10 23:57:35,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3d6b2cdc/0c205f1fb2514c2c92b14b2e21a7c533/FLAGe72ca8988 [2024-10-10 23:57:35,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3d6b2cdc/0c205f1fb2514c2c92b14b2e21a7c533 [2024-10-10 23:57:35,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:57:35,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:57:35,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:57:35,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:57:35,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:57:35,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:57:35" (1/1) ... [2024-10-10 23:57:35,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4c1b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:35, skipping insertion in model container [2024-10-10 23:57:35,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:57:35" (1/1) ... [2024-10-10 23:57:36,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:57:36,340 WARN L248 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/Problem19_label17.c[1799,1812] [2024-10-10 23:57:37,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:57:37,710 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:57:37,724 WARN L248 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/Problem19_label17.c[1799,1812] [2024-10-10 23:57:38,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:57:38,474 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:57:38,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38 WrapperNode [2024-10-10 23:57:38,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:57:38,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:57:38,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:57:38,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:57:38,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:38,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:39,368 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:57:39,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:57:39,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:57:39,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:57:39,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:57:39,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:39,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:39,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:39,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:57:39,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:39,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:57:40,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:57:40,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:57:40,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:57:40,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (1/1) ... [2024-10-10 23:57:40,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:57:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:57:40,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:57:40,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:57:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:57:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:57:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:57:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:57:41,101 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:57:41,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:57:48,442 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:57:48,443 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:57:48,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:57:48,539 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:57:48,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:57:48 BoogieIcfgContainer [2024-10-10 23:57:48,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:57:48,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:57:48,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:57:48,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:57:48,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:57:35" (1/3) ... [2024-10-10 23:57:48,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412f9323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:57:48, skipping insertion in model container [2024-10-10 23:57:48,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:38" (2/3) ... [2024-10-10 23:57:48,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412f9323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:57:48, skipping insertion in model container [2024-10-10 23:57:48,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:57:48" (3/3) ... [2024-10-10 23:57:48,550 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label17.c [2024-10-10 23:57:48,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:57:48,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:57:48,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:57:48,683 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;@7db5a3cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:57:48,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:57:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:57:48,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:48,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:48,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1826423932, now seen corresponding path program 1 times [2024-10-10 23:57:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109261374] [2024-10-10 23:57:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:57:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109261374] [2024-10-10 23:57:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109261374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:57:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128447313] [2024-10-10 23:57:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:48,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:57:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:57:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:57:48,910 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:49,027 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:57:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:57:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-10 23:57:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:49,050 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:57:49,050 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:57:49,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:57:49,061 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:49,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:57:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:57:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:57:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:57:49,171 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 9 [2024-10-10 23:57:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:49,172 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:57:49,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:57:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:57:49,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:49,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:57:49,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:57:49,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1578169763, now seen corresponding path program 1 times [2024-10-10 23:57:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793306782] [2024-10-10 23:57:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:57:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793306782] [2024-10-10 23:57:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793306782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:49,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:49,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:57:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458776900] [2024-10-10 23:57:49,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:49,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:57:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:57:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:49,261 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:57:56,098 INFO L93 Difference]: Finished difference Result 4862 states and 9131 transitions. [2024-10-10 23:57:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:57:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-10 23:57:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:57:56,115 INFO L225 Difference]: With dead ends: 4862 [2024-10-10 23:57:56,115 INFO L226 Difference]: Without dead ends: 3179 [2024-10-10 23:57:56,117 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-10-10 23:57:56,118 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1638 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 2020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2020 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:57:56,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 1110 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2020 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-10 23:57:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-10 23:57:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3121. [2024-10-10 23:57:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.728525641025641) internal successors, (5393), 3120 states have internal predecessors, (5393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5393 transitions. [2024-10-10 23:57:56,210 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5393 transitions. Word has length 9 [2024-10-10 23:57:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:57:56,210 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5393 transitions. [2024-10-10 23:57:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:57:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5393 transitions. [2024-10-10 23:57:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-10 23:57:56,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:56,215 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 23:57:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:57:56,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1151055359, now seen corresponding path program 1 times [2024-10-10 23:57:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179604996] [2024-10-10 23:57:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:57:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:57:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:57:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:57:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179604996] [2024-10-10 23:57:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179604996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:57:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:57:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:57:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447573962] [2024-10-10 23:57:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:57:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:57:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:57:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:57:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:57:56,522 INFO L87 Difference]: Start difference. First operand 3121 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:02,352 INFO L93 Difference]: Finished difference Result 9134 states and 15859 transitions. [2024-10-10 23:58:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2024-10-10 23:58:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:02,375 INFO L225 Difference]: With dead ends: 9134 [2024-10-10 23:58:02,375 INFO L226 Difference]: Without dead ends: 6014 [2024-10-10 23:58:02,379 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-10-10 23:58:02,380 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:02,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-10 23:58:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-10-10 23:58:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2024-10-10 23:58:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.6709366162036268) internal successors, (10044), 6011 states have internal predecessors, (10044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 10044 transitions. [2024-10-10 23:58:02,486 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 10044 transitions. Word has length 77 [2024-10-10 23:58:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 10044 transitions. [2024-10-10 23:58:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 10044 transitions. [2024-10-10 23:58:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-10 23:58:02,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:02,490 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:58:02,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:58:02,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1126851332, now seen corresponding path program 1 times [2024-10-10 23:58:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:02,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616150938] [2024-10-10 23:58:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616150938] [2024-10-10 23:58:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616150938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:02,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:02,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320219460] [2024-10-10 23:58:02,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:02,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:02,670 INFO L87 Difference]: Start difference. First operand 6012 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:08,293 INFO L93 Difference]: Finished difference Result 17597 states and 29554 transitions. [2024-10-10 23:58:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2024-10-10 23:58:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:08,330 INFO L225 Difference]: With dead ends: 17597 [2024-10-10 23:58:08,330 INFO L226 Difference]: Without dead ends: 11586 [2024-10-10 23:58:08,343 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-10-10 23:58:08,344 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 1470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1470 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1716 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1470 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:58:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2024-10-10 23:58:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11551. [2024-10-10 23:58:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11551 states, 11550 states have (on average 1.4577489177489178) internal successors, (16837), 11550 states have internal predecessors, (16837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 16837 transitions. [2024-10-10 23:58:08,614 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 16837 transitions. Word has length 80 [2024-10-10 23:58:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:08,615 INFO L471 AbstractCegarLoop]: Abstraction has 11551 states and 16837 transitions. [2024-10-10 23:58:08,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 16837 transitions. [2024-10-10 23:58:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-10 23:58:08,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:08,621 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:58:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:58:08,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1466059533, now seen corresponding path program 1 times [2024-10-10 23:58:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087778303] [2024-10-10 23:58:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087778303] [2024-10-10 23:58:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087778303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207673483] [2024-10-10 23:58:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:08,843 INFO L87 Difference]: Start difference. First operand 11551 states and 16837 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:14,345 INFO L93 Difference]: Finished difference Result 34261 states and 50006 transitions. [2024-10-10 23:58:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-10-10 23:58:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:14,402 INFO L225 Difference]: With dead ends: 34261 [2024-10-10 23:58:14,402 INFO L226 Difference]: Without dead ends: 22711 [2024-10-10 23:58:14,421 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-10-10 23:58:14,423 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:14,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2121 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4316 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-10 23:58:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22711 states. [2024-10-10 23:58:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22711 to 22686. [2024-10-10 23:58:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 1.281948424068768) internal successors, (29081), 22685 states have internal predecessors, (29081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 29081 transitions. [2024-10-10 23:58:14,770 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 29081 transitions. Word has length 106 [2024-10-10 23:58:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:14,770 INFO L471 AbstractCegarLoop]: Abstraction has 22686 states and 29081 transitions. [2024-10-10 23:58:14,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 29081 transitions. [2024-10-10 23:58:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-10 23:58:14,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:14,786 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-10-10 23:58:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:58:14,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:14,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 301166373, now seen corresponding path program 1 times [2024-10-10 23:58:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974708272] [2024-10-10 23:58:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:58:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974708272] [2024-10-10 23:58:16,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974708272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:16,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:16,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:16,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280248311] [2024-10-10 23:58:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:16,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:58:16,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:16,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:58:16,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:16,266 INFO L87 Difference]: Start difference. First operand 22686 states and 29081 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:24,264 INFO L93 Difference]: Finished difference Result 57743 states and 72060 transitions. [2024-10-10 23:58:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:58:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 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 388 [2024-10-10 23:58:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:24,331 INFO L225 Difference]: With dead ends: 57743 [2024-10-10 23:58:24,332 INFO L226 Difference]: Without dead ends: 35058 [2024-10-10 23:58:24,355 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-10-10 23:58:24,358 INFO L432 NwaCegarLoop]: 1789 mSDtfsCounter, 3752 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 9617 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 9789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 9617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:24,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 2146 Invalid, 9789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 9617 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-10 23:58:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35058 states. [2024-10-10 23:58:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35058 to 33648. [2024-10-10 23:58:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33648 states, 33647 states have (on average 1.2262608850714773) internal successors, (41260), 33647 states have internal predecessors, (41260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33648 states to 33648 states and 41260 transitions. [2024-10-10 23:58:24,813 INFO L78 Accepts]: Start accepts. Automaton has 33648 states and 41260 transitions. Word has length 388 [2024-10-10 23:58:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:24,813 INFO L471 AbstractCegarLoop]: Abstraction has 33648 states and 41260 transitions. [2024-10-10 23:58:24,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33648 states and 41260 transitions. [2024-10-10 23:58:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-10-10 23:58:24,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:24,825 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 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, 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] [2024-10-10 23:58:24,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:58:24,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:24,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash -789356104, now seen corresponding path program 1 times [2024-10-10 23:58:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:24,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161952480] [2024-10-10 23:58:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:58:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161952480] [2024-10-10 23:58:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161952480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881322118] [2024-10-10 23:58:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:58:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:26,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:58:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:26,064 INFO L87 Difference]: Start difference. First operand 33648 states and 41260 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:34,001 INFO L93 Difference]: Finished difference Result 90599 states and 108577 transitions. [2024-10-10 23:58:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:58:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 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 595 [2024-10-10 23:58:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:34,094 INFO L225 Difference]: With dead ends: 90599 [2024-10-10 23:58:34,094 INFO L226 Difference]: Without dead ends: 56952 [2024-10-10 23:58:34,135 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-10-10 23:58:34,138 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 3757 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 9353 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 9615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 9353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:34,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2099 Invalid, 9615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 9353 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-10 23:58:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56952 states. [2024-10-10 23:58:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56952 to 52813. [2024-10-10 23:58:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52813 states, 52812 states have (on average 1.1742028326895402) internal successors, (62012), 52812 states have internal predecessors, (62012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52813 states to 52813 states and 62012 transitions. [2024-10-10 23:58:34,773 INFO L78 Accepts]: Start accepts. Automaton has 52813 states and 62012 transitions. Word has length 595 [2024-10-10 23:58:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:34,774 INFO L471 AbstractCegarLoop]: Abstraction has 52813 states and 62012 transitions. [2024-10-10 23:58:34,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52813 states and 62012 transitions. [2024-10-10 23:58:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-10-10 23:58:34,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:34,787 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 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, 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] [2024-10-10 23:58:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:58:34,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash 693923230, now seen corresponding path program 1 times [2024-10-10 23:58:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118611720] [2024-10-10 23:58:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:58:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118611720] [2024-10-10 23:58:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118611720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:35,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957618824] [2024-10-10 23:58:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:35,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:58:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:58:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:35,776 INFO L87 Difference]: Start difference. First operand 52813 states and 62012 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:40,997 INFO L93 Difference]: Finished difference Result 108386 states and 126802 transitions. [2024-10-10 23:58:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:58:40,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 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 623 [2024-10-10 23:58:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:41,083 INFO L225 Difference]: With dead ends: 108386 [2024-10-10 23:58:41,083 INFO L226 Difference]: Without dead ends: 55543 [2024-10-10 23:58:41,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:41,129 INFO L432 NwaCegarLoop]: 1766 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 5722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:41,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1944 Invalid, 5722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-10 23:58:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55543 states. [2024-10-10 23:58:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55543 to 55543. [2024-10-10 23:58:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55543 states, 55542 states have (on average 1.1657304382269273) internal successors, (64747), 55542 states have internal predecessors, (64747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55543 states to 55543 states and 64747 transitions. [2024-10-10 23:58:42,142 INFO L78 Accepts]: Start accepts. Automaton has 55543 states and 64747 transitions. Word has length 623 [2024-10-10 23:58:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:42,143 INFO L471 AbstractCegarLoop]: Abstraction has 55543 states and 64747 transitions. [2024-10-10 23:58:42,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 55543 states and 64747 transitions. [2024-10-10 23:58:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-10-10 23:58:42,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:42,153 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:58:42,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:58:42,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:42,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1830784581, now seen corresponding path program 1 times [2024-10-10 23:58:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251472426] [2024-10-10 23:58:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-10 23:58:42,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:42,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251472426] [2024-10-10 23:58:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251472426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:42,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424358079] [2024-10-10 23:58:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:42,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:42,978 INFO L87 Difference]: Start difference. First operand 55543 states and 64747 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:48,945 INFO L93 Difference]: Finished difference Result 128985 states and 152609 transitions. [2024-10-10 23:58:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 708 [2024-10-10 23:58:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:49,025 INFO L225 Difference]: With dead ends: 128985 [2024-10-10 23:58:49,025 INFO L226 Difference]: Without dead ends: 76173 [2024-10-10 23:58:49,051 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-10-10 23:58:49,052 INFO L432 NwaCegarLoop]: 3212 mSDtfsCounter, 1466 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 6086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:49,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 3387 Invalid, 6086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:58:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76173 states. [2024-10-10 23:58:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76173 to 76080. [2024-10-10 23:58:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76080 states, 76079 states have (on average 1.1458878271270654) internal successors, (87178), 76079 states have internal predecessors, (87178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 87178 transitions. [2024-10-10 23:58:49,910 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 87178 transitions. Word has length 708 [2024-10-10 23:58:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 76080 states and 87178 transitions. [2024-10-10 23:58:49,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 87178 transitions. [2024-10-10 23:58:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2024-10-10 23:58:49,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:49,917 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:58:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:58:49,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 958835570, now seen corresponding path program 1 times [2024-10-10 23:58:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626260733] [2024-10-10 23:58:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat