./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:49:40,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:49:40,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:49:40,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:49:40,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:49:40,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:49:40,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:49:40,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:49:40,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:49:40,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:49:40,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:49:40,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:49:40,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:49:40,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:49:40,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:49:40,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:40,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:40,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:49:40,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:49:40,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2025-01-08 22:49:40,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:49:40,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:49:40,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:49:40,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:49:40,788 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:49:40,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2025-01-08 22:49:41,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1544034db/00b09fdb09bd4e30ab327f982e166e1c/FLAG2f782df78 [2025-01-08 22:49:42,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:49:42,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2025-01-08 22:49:42,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1544034db/00b09fdb09bd4e30ab327f982e166e1c/FLAG2f782df78 [2025-01-08 22:49:42,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1544034db/00b09fdb09bd4e30ab327f982e166e1c [2025-01-08 22:49:42,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:49:42,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:49:42,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:42,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:49:42,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:49:42,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebdb090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42, skipping insertion in model container [2025-01-08 22:49:42,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:49:42,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2025-01-08 22:49:42,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:42,337 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:49:42,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2025-01-08 22:49:42,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:42,371 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:49:42,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42 WrapperNode [2025-01-08 22:49:42,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:42,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:42,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:49:42,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:49:42,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,393 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 193 [2025-01-08 22:49:42,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:42,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:49:42,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:49:42,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:49:42,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,412 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]. [2025-01-08 22:49:42,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:49:42,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:49:42,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:49:42,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:49:42,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (1/1) ... [2025-01-08 22:49:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:42,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:49:42,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:49:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:49:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:49:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:49:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:49:42,501 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:49:42,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:49:42,690 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-01-08 22:49:42,690 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:49:42,697 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:49:42,697 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:49:42,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:42 BoogieIcfgContainer [2025-01-08 22:49:42,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:49:42,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:49:42,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:49:42,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:49:42,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:49:42" (1/3) ... [2025-01-08 22:49:42,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3445568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:42, skipping insertion in model container [2025-01-08 22:49:42,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:42" (2/3) ... [2025-01-08 22:49:42,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3445568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:42, skipping insertion in model container [2025-01-08 22:49:42,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:42" (3/3) ... [2025-01-08 22:49:42,704 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2025-01-08 22:49:42,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:49:42,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_14-1.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:49:42,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:49:42,762 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;@1e1b4fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:49:42,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:49:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.9) internal successors, (95), 51 states have internal predecessors, (95), 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) [2025-01-08 22:49:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:42,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:42,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:42,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:42,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1605131182, now seen corresponding path program 1 times [2025-01-08 22:49:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319864405] [2025-01-08 22:49:42,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:42,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:42,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:42,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:42,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319864405] [2025-01-08 22:49:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319864405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22245421] [2025-01-08 22:49:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,007 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.9) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-08 22:49:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,056 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2025-01-08 22:49:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-01-08 22:49:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,064 INFO L225 Difference]: With dead ends: 149 [2025-01-08 22:49:43,064 INFO L226 Difference]: Without dead ends: 93 [2025-01-08 22:49:43,068 INFO L434 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 [2025-01-08 22:49:43,071 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 185 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-08 22:49:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-01-08 22:49:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.9) internal successors, (171), 90 states have internal predecessors, (171), 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) [2025-01-08 22:49:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 171 transitions. [2025-01-08 22:49:43,100 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 171 transitions. Word has length 21 [2025-01-08 22:49:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,100 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 171 transitions. [2025-01-08 22:49:43,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-08 22:49:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2025-01-08 22:49:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:43,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:49:43,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1101488212, now seen corresponding path program 1 times [2025-01-08 22:49:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835891399] [2025-01-08 22:49:43,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:43,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:43,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835891399] [2025-01-08 22:49:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835891399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854832034] [2025-01-08 22:49:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,191 INFO L87 Difference]: Start difference. First operand 91 states and 171 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-08 22:49:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,219 INFO L93 Difference]: Finished difference Result 123 states and 227 transitions. [2025-01-08 22:49:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-01-08 22:49:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,220 INFO L225 Difference]: With dead ends: 123 [2025-01-08 22:49:43,220 INFO L226 Difference]: Without dead ends: 121 [2025-01-08 22:49:43,221 INFO L434 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 [2025-01-08 22:49:43,221 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-08 22:49:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2025-01-08 22:49:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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) [2025-01-08 22:49:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2025-01-08 22:49:43,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2025-01-08 22:49:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,233 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2025-01-08 22:49:43,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-08 22:49:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2025-01-08 22:49:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:43,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:49:43,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1780328863, now seen corresponding path program 1 times [2025-01-08 22:49:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870714934] [2025-01-08 22:49:43,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:43,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870714934] [2025-01-08 22:49:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870714934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090846677] [2025-01-08 22:49:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,285 INFO L87 Difference]: Start difference. First operand 91 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-01-08 22:49:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,303 INFO L93 Difference]: Finished difference Result 178 states and 332 transitions. [2025-01-08 22:49:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-01-08 22:49:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,304 INFO L225 Difference]: With dead ends: 178 [2025-01-08 22:49:43,304 INFO L226 Difference]: Without dead ends: 176 [2025-01-08 22:49:43,304 INFO L434 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 [2025-01-08 22:49:43,305 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-08 22:49:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2025-01-08 22:49:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.884297520661157) internal successors, (228), 121 states have internal predecessors, (228), 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) [2025-01-08 22:49:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 228 transitions. [2025-01-08 22:49:43,318 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 228 transitions. Word has length 22 [2025-01-08 22:49:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 228 transitions. [2025-01-08 22:49:43,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-01-08 22:49:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 228 transitions. [2025-01-08 22:49:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:43,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:49:43,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 926290531, now seen corresponding path program 1 times [2025-01-08 22:49:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271114924] [2025-01-08 22:49:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:43,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:43,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271114924] [2025-01-08 22:49:43,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271114924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365038284] [2025-01-08 22:49:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,378 INFO L87 Difference]: Start difference. First operand 122 states and 228 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-01-08 22:49:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,401 INFO L93 Difference]: Finished difference Result 298 states and 558 transitions. [2025-01-08 22:49:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-01-08 22:49:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,403 INFO L225 Difference]: With dead ends: 298 [2025-01-08 22:49:43,404 INFO L226 Difference]: Without dead ends: 178 [2025-01-08 22:49:43,405 INFO L434 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 [2025-01-08 22:49:43,405 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-08 22:49:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2025-01-08 22:49:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.8685714285714285) internal successors, (327), 175 states have internal predecessors, (327), 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) [2025-01-08 22:49:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 327 transitions. [2025-01-08 22:49:43,414 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 327 transitions. Word has length 22 [2025-01-08 22:49:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 327 transitions. [2025-01-08 22:49:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-01-08 22:49:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 327 transitions. [2025-01-08 22:49:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:43,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:49:43,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 644592483, now seen corresponding path program 1 times [2025-01-08 22:49:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105016204] [2025-01-08 22:49:43,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:43,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:43,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105016204] [2025-01-08 22:49:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105016204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157165478] [2025-01-08 22:49:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,465 INFO L87 Difference]: Start difference. First operand 176 states and 327 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,482 INFO L93 Difference]: Finished difference Result 270 states and 496 transitions. [2025-01-08 22:49:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-01-08 22:49:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,483 INFO L225 Difference]: With dead ends: 270 [2025-01-08 22:49:43,483 INFO L226 Difference]: Without dead ends: 183 [2025-01-08 22:49:43,485 INFO L434 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 [2025-01-08 22:49:43,486 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-08 22:49:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-01-08 22:49:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8388888888888888) internal successors, (331), 180 states have internal predecessors, (331), 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) [2025-01-08 22:49:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 331 transitions. [2025-01-08 22:49:43,497 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 331 transitions. Word has length 23 [2025-01-08 22:49:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,498 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 331 transitions. [2025-01-08 22:49:43,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 331 transitions. [2025-01-08 22:49:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:43,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:49:43,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1349552223, now seen corresponding path program 1 times [2025-01-08 22:49:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894581221] [2025-01-08 22:49:43,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:43,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:43,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894581221] [2025-01-08 22:49:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894581221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107175701] [2025-01-08 22:49:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,535 INFO L87 Difference]: Start difference. First operand 181 states and 331 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,551 INFO L93 Difference]: Finished difference Result 345 states and 635 transitions. [2025-01-08 22:49:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-01-08 22:49:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,553 INFO L225 Difference]: With dead ends: 345 [2025-01-08 22:49:43,553 INFO L226 Difference]: Without dead ends: 343 [2025-01-08 22:49:43,553 INFO L434 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 [2025-01-08 22:49:43,554 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 62 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-08 22:49:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 245. [2025-01-08 22:49:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.8237704918032787) internal successors, (445), 244 states have internal predecessors, (445), 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) [2025-01-08 22:49:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 445 transitions. [2025-01-08 22:49:43,570 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 445 transitions. Word has length 23 [2025-01-08 22:49:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 445 transitions. [2025-01-08 22:49:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 445 transitions. [2025-01-08 22:49:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:43,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:49:43,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1357067171, now seen corresponding path program 1 times [2025-01-08 22:49:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770141828] [2025-01-08 22:49:43,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:43,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:43,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770141828] [2025-01-08 22:49:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770141828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253405824] [2025-01-08 22:49:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,603 INFO L87 Difference]: Start difference. First operand 245 states and 445 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,621 INFO L93 Difference]: Finished difference Result 589 states and 1075 transitions. [2025-01-08 22:49:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-01-08 22:49:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,623 INFO L225 Difference]: With dead ends: 589 [2025-01-08 22:49:43,623 INFO L226 Difference]: Without dead ends: 351 [2025-01-08 22:49:43,623 INFO L434 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 [2025-01-08 22:49:43,624 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-08 22:49:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2025-01-08 22:49:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8132183908045978) internal successors, (631), 348 states have internal predecessors, (631), 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) [2025-01-08 22:49:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 631 transitions. [2025-01-08 22:49:43,635 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 631 transitions. Word has length 23 [2025-01-08 22:49:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,635 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 631 transitions. [2025-01-08 22:49:43,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-08 22:49:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 631 transitions. [2025-01-08 22:49:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:43,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:49:43,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1113766776, now seen corresponding path program 1 times [2025-01-08 22:49:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118035005] [2025-01-08 22:49:43,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:43,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:43,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118035005] [2025-01-08 22:49:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118035005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330274736] [2025-01-08 22:49:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,668 INFO L87 Difference]: Start difference. First operand 349 states and 631 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,687 INFO L93 Difference]: Finished difference Result 525 states and 945 transitions. [2025-01-08 22:49:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-01-08 22:49:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,688 INFO L225 Difference]: With dead ends: 525 [2025-01-08 22:49:43,688 INFO L226 Difference]: Without dead ends: 355 [2025-01-08 22:49:43,689 INFO L434 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 [2025-01-08 22:49:43,689 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-08 22:49:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2025-01-08 22:49:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.7926136363636365) internal successors, (631), 352 states have internal predecessors, (631), 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) [2025-01-08 22:49:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 631 transitions. [2025-01-08 22:49:43,700 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 631 transitions. Word has length 24 [2025-01-08 22:49:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,700 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 631 transitions. [2025-01-08 22:49:43,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 631 transitions. [2025-01-08 22:49:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:43,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:49:43,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash -880377930, now seen corresponding path program 1 times [2025-01-08 22:49:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545055212] [2025-01-08 22:49:43,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545055212] [2025-01-08 22:49:43,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545055212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103641469] [2025-01-08 22:49:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,733 INFO L87 Difference]: Start difference. First operand 353 states and 631 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,748 INFO L93 Difference]: Finished difference Result 665 states and 1201 transitions. [2025-01-08 22:49:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-01-08 22:49:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,752 INFO L225 Difference]: With dead ends: 665 [2025-01-08 22:49:43,752 INFO L226 Difference]: Without dead ends: 663 [2025-01-08 22:49:43,752 INFO L434 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 [2025-01-08 22:49:43,755 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-08 22:49:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 485. [2025-01-08 22:49:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.7665289256198347) internal successors, (855), 484 states have internal predecessors, (855), 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) [2025-01-08 22:49:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2025-01-08 22:49:43,773 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 24 [2025-01-08 22:49:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,773 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2025-01-08 22:49:43,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2025-01-08 22:49:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:43,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:49:43,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1826241464, now seen corresponding path program 1 times [2025-01-08 22:49:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007069687] [2025-01-08 22:49:43,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:43,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007069687] [2025-01-08 22:49:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007069687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390299103] [2025-01-08 22:49:43,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,819 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,839 INFO L93 Difference]: Finished difference Result 1161 states and 2057 transitions. [2025-01-08 22:49:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-01-08 22:49:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,841 INFO L225 Difference]: With dead ends: 1161 [2025-01-08 22:49:43,841 INFO L226 Difference]: Without dead ends: 687 [2025-01-08 22:49:43,842 INFO L434 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 [2025-01-08 22:49:43,843 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-08 22:49:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2025-01-08 22:49:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.7587719298245614) internal successors, (1203), 684 states have internal predecessors, (1203), 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) [2025-01-08 22:49:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1203 transitions. [2025-01-08 22:49:43,858 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1203 transitions. Word has length 24 [2025-01-08 22:49:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,858 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1203 transitions. [2025-01-08 22:49:43,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-01-08 22:49:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1203 transitions. [2025-01-08 22:49:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:43,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:49:43,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1521698984, now seen corresponding path program 1 times [2025-01-08 22:49:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564802659] [2025-01-08 22:49:43,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:43,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:43,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564802659] [2025-01-08 22:49:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564802659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634402845] [2025-01-08 22:49:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,880 INFO L87 Difference]: Start difference. First operand 685 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,899 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2025-01-08 22:49:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-01-08 22:49:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,902 INFO L225 Difference]: With dead ends: 1029 [2025-01-08 22:49:43,902 INFO L226 Difference]: Without dead ends: 695 [2025-01-08 22:49:43,905 INFO L434 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 [2025-01-08 22:49:43,905 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-08 22:49:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2025-01-08 22:49:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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) [2025-01-08 22:49:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2025-01-08 22:49:43,921 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2025-01-08 22:49:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2025-01-08 22:49:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2025-01-08 22:49:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:43,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:49:43,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash 779123606, now seen corresponding path program 1 times [2025-01-08 22:49:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592621398] [2025-01-08 22:49:43,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:43,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592621398] [2025-01-08 22:49:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592621398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913338572] [2025-01-08 22:49:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,943 INFO L87 Difference]: Start difference. First operand 693 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,963 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2025-01-08 22:49:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-01-08 22:49:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,967 INFO L225 Difference]: With dead ends: 1289 [2025-01-08 22:49:43,967 INFO L226 Difference]: Without dead ends: 1287 [2025-01-08 22:49:43,968 INFO L434 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 [2025-01-08 22:49:43,968 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:43,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-01-08 22:49:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2025-01-08 22:49:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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) [2025-01-08 22:49:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2025-01-08 22:49:43,990 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2025-01-08 22:49:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,991 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2025-01-08 22:49:43,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2025-01-08 22:49:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:43,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:49:43,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash -809224296, now seen corresponding path program 1 times [2025-01-08 22:49:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471040108] [2025-01-08 22:49:43,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:44,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:44,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471040108] [2025-01-08 22:49:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471040108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679580887] [2025-01-08 22:49:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,013 INFO L87 Difference]: Start difference. First operand 965 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,049 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2025-01-08 22:49:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-01-08 22:49:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,054 INFO L225 Difference]: With dead ends: 2297 [2025-01-08 22:49:44,054 INFO L226 Difference]: Without dead ends: 1351 [2025-01-08 22:49:44,056 INFO L434 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 [2025-01-08 22:49:44,057 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-01-08 22:49:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2025-01-08 22:49:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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) [2025-01-08 22:49:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2025-01-08 22:49:44,087 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2025-01-08 22:49:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,088 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2025-01-08 22:49:44,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-01-08 22:49:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2025-01-08 22:49:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:44,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:49:44,089 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1616758579, now seen corresponding path program 1 times [2025-01-08 22:49:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545154216] [2025-01-08 22:49:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:44,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545154216] [2025-01-08 22:49:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545154216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113030062] [2025-01-08 22:49:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,116 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,143 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2025-01-08 22:49:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-01-08 22:49:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,148 INFO L225 Difference]: With dead ends: 2025 [2025-01-08 22:49:44,148 INFO L226 Difference]: Without dead ends: 1367 [2025-01-08 22:49:44,149 INFO L434 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 [2025-01-08 22:49:44,149 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-01-08 22:49:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2025-01-08 22:49:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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) [2025-01-08 22:49:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2025-01-08 22:49:44,178 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2025-01-08 22:49:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,178 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2025-01-08 22:49:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2025-01-08 22:49:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:44,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:49:44,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 684064011, now seen corresponding path program 1 times [2025-01-08 22:49:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423383574] [2025-01-08 22:49:44,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:44,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:44,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423383574] [2025-01-08 22:49:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423383574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406113170] [2025-01-08 22:49:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,198 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,228 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2025-01-08 22:49:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-01-08 22:49:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,235 INFO L225 Difference]: With dead ends: 2505 [2025-01-08 22:49:44,235 INFO L226 Difference]: Without dead ends: 2503 [2025-01-08 22:49:44,236 INFO L434 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 [2025-01-08 22:49:44,237 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-01-08 22:49:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2025-01-08 22:49:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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) [2025-01-08 22:49:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2025-01-08 22:49:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2025-01-08 22:49:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,292 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2025-01-08 22:49:44,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2025-01-08 22:49:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:44,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:49:44,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -904283891, now seen corresponding path program 1 times [2025-01-08 22:49:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370976211] [2025-01-08 22:49:44,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:44,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:44,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370976211] [2025-01-08 22:49:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370976211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757245493] [2025-01-08 22:49:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,315 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,354 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2025-01-08 22:49:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-01-08 22:49:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,361 INFO L225 Difference]: With dead ends: 4553 [2025-01-08 22:49:44,361 INFO L226 Difference]: Without dead ends: 2663 [2025-01-08 22:49:44,363 INFO L434 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 [2025-01-08 22:49:44,365 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-01-08 22:49:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2025-01-08 22:49:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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) [2025-01-08 22:49:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2025-01-08 22:49:44,440 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2025-01-08 22:49:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,440 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2025-01-08 22:49:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-08 22:49:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2025-01-08 22:49:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:44,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:49:44,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash -268638387, now seen corresponding path program 1 times [2025-01-08 22:49:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159040299] [2025-01-08 22:49:44,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:44,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:44,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159040299] [2025-01-08 22:49:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159040299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212724906] [2025-01-08 22:49:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,471 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,518 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2025-01-08 22:49:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-01-08 22:49:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,525 INFO L225 Difference]: With dead ends: 3993 [2025-01-08 22:49:44,526 INFO L226 Difference]: Without dead ends: 2695 [2025-01-08 22:49:44,527 INFO L434 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 [2025-01-08 22:49:44,527 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2025-01-08 22:49:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2025-01-08 22:49:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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) [2025-01-08 22:49:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2025-01-08 22:49:44,601 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2025-01-08 22:49:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,601 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2025-01-08 22:49:44,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2025-01-08 22:49:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:44,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:49:44,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2032184203, now seen corresponding path program 1 times [2025-01-08 22:49:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953505696] [2025-01-08 22:49:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:44,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:44,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953505696] [2025-01-08 22:49:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953505696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270893544] [2025-01-08 22:49:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,632 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,707 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2025-01-08 22:49:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-01-08 22:49:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,721 INFO L225 Difference]: With dead ends: 4873 [2025-01-08 22:49:44,721 INFO L226 Difference]: Without dead ends: 4871 [2025-01-08 22:49:44,722 INFO L434 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 [2025-01-08 22:49:44,723 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2025-01-08 22:49:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2025-01-08 22:49:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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) [2025-01-08 22:49:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2025-01-08 22:49:44,830 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2025-01-08 22:49:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,830 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2025-01-08 22:49:44,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2025-01-08 22:49:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:44,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:49:44,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 443836301, now seen corresponding path program 1 times [2025-01-08 22:49:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752641285] [2025-01-08 22:49:44,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:44,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:44,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752641285] [2025-01-08 22:49:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752641285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367533404] [2025-01-08 22:49:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,857 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,958 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2025-01-08 22:49:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-01-08 22:49:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:44,970 INFO L225 Difference]: With dead ends: 9033 [2025-01-08 22:49:44,971 INFO L226 Difference]: Without dead ends: 5255 [2025-01-08 22:49:44,973 INFO L434 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 [2025-01-08 22:49:44,974 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2025-01-08 22:49:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2025-01-08 22:49:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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) [2025-01-08 22:49:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2025-01-08 22:49:45,086 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2025-01-08 22:49:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:45,087 INFO L471 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2025-01-08 22:49:45,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-01-08 22:49:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2025-01-08 22:49:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:45,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:45,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:45,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:49:45,091 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1426585054, now seen corresponding path program 1 times [2025-01-08 22:49:45,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:45,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598427697] [2025-01-08 22:49:45,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:45,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:45,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598427697] [2025-01-08 22:49:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598427697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752903029] [2025-01-08 22:49:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:45,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:45,114 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:45,172 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2025-01-08 22:49:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:45,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-01-08 22:49:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:45,184 INFO L225 Difference]: With dead ends: 7881 [2025-01-08 22:49:45,185 INFO L226 Difference]: Without dead ends: 5319 [2025-01-08 22:49:45,188 INFO L434 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 [2025-01-08 22:49:45,188 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:45,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2025-01-08 22:49:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2025-01-08 22:49:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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) [2025-01-08 22:49:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2025-01-08 22:49:45,306 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2025-01-08 22:49:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:45,307 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2025-01-08 22:49:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2025-01-08 22:49:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:45,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:45,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:45,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:49:45,310 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 874237536, now seen corresponding path program 1 times [2025-01-08 22:49:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65794405] [2025-01-08 22:49:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:45,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:45,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:45,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:45,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65794405] [2025-01-08 22:49:45,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65794405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:45,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630515801] [2025-01-08 22:49:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:45,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:45,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:45,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:45,332 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:45,407 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2025-01-08 22:49:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-01-08 22:49:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:45,421 INFO L225 Difference]: With dead ends: 9481 [2025-01-08 22:49:45,421 INFO L226 Difference]: Without dead ends: 9479 [2025-01-08 22:49:45,424 INFO L434 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 [2025-01-08 22:49:45,425 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:45,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2025-01-08 22:49:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2025-01-08 22:49:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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) [2025-01-08 22:49:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2025-01-08 22:49:45,594 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2025-01-08 22:49:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:45,594 INFO L471 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2025-01-08 22:49:45,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2025-01-08 22:49:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:45,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:45,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:45,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:49:45,601 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:45,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash -714110366, now seen corresponding path program 1 times [2025-01-08 22:49:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112931723] [2025-01-08 22:49:45,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:45,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:45,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:45,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:45,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:45,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112931723] [2025-01-08 22:49:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112931723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:45,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834367742] [2025-01-08 22:49:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:45,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:45,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:45,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:45,617 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:45,712 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2025-01-08 22:49:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-01-08 22:49:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:45,728 INFO L225 Difference]: With dead ends: 17929 [2025-01-08 22:49:45,728 INFO L226 Difference]: Without dead ends: 10375 [2025-01-08 22:49:45,736 INFO L434 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 [2025-01-08 22:49:45,738 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:45,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2025-01-08 22:49:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2025-01-08 22:49:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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) [2025-01-08 22:49:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2025-01-08 22:49:45,991 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2025-01-08 22:49:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:45,991 INFO L471 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2025-01-08 22:49:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-08 22:49:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2025-01-08 22:49:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:46,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:46,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:46,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:49:46,000 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:46,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1331774274, now seen corresponding path program 1 times [2025-01-08 22:49:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456688429] [2025-01-08 22:49:46,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:46,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:46,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:46,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:46,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456688429] [2025-01-08 22:49:46,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456688429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:46,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:46,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039959270] [2025-01-08 22:49:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:46,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:46,026 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:46,149 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2025-01-08 22:49:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-01-08 22:49:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:46,167 INFO L225 Difference]: With dead ends: 15561 [2025-01-08 22:49:46,167 INFO L226 Difference]: Without dead ends: 10503 [2025-01-08 22:49:46,175 INFO L434 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 [2025-01-08 22:49:46,175 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:46,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2025-01-08 22:49:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2025-01-08 22:49:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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) [2025-01-08 22:49:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2025-01-08 22:49:46,417 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2025-01-08 22:49:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2025-01-08 22:49:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2025-01-08 22:49:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:46,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:46,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:46,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:49:46,424 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -662370432, now seen corresponding path program 1 times [2025-01-08 22:49:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370404632] [2025-01-08 22:49:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:46,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:46,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:46,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:46,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:46,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370404632] [2025-01-08 22:49:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370404632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22326898] [2025-01-08 22:49:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:46,440 INFO L87 Difference]: Start difference. First operand 10501 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:46,586 INFO L93 Difference]: Finished difference Result 30729 states and 45317 transitions. [2025-01-08 22:49:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-01-08 22:49:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:46,617 INFO L225 Difference]: With dead ends: 30729 [2025-01-08 22:49:46,617 INFO L226 Difference]: Without dead ends: 20487 [2025-01-08 22:49:46,630 INFO L434 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 [2025-01-08 22:49:46,631 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:46,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2025-01-08 22:49:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20485. [2025-01-08 22:49:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.4498633079476664) internal successors, (29699), 20484 states have internal predecessors, (29699), 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) [2025-01-08 22:49:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29699 transitions. [2025-01-08 22:49:46,986 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29699 transitions. Word has length 29 [2025-01-08 22:49:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:46,986 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 29699 transitions. [2025-01-08 22:49:46,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29699 transitions. [2025-01-08 22:49:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:46,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:49:46,998 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 925977470, now seen corresponding path program 1 times [2025-01-08 22:49:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267596319] [2025-01-08 22:49:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:47,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267596319] [2025-01-08 22:49:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267596319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722704198] [2025-01-08 22:49:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:47,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:47,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:47,024 INFO L87 Difference]: Start difference. First operand 20485 states and 29699 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:47,208 INFO L93 Difference]: Finished difference Result 23561 states and 35333 transitions. [2025-01-08 22:49:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-01-08 22:49:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:47,240 INFO L225 Difference]: With dead ends: 23561 [2025-01-08 22:49:47,240 INFO L226 Difference]: Without dead ends: 23559 [2025-01-08 22:49:47,244 INFO L434 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 [2025-01-08 22:49:47,245 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:47,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 212 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23559 states. [2025-01-08 22:49:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23559 to 20485. [2025-01-08 22:49:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.4373657488771725) internal successors, (29443), 20484 states have internal predecessors, (29443), 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) [2025-01-08 22:49:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29443 transitions. [2025-01-08 22:49:47,590 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29443 transitions. Word has length 29 [2025-01-08 22:49:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 29443 transitions. [2025-01-08 22:49:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-01-08 22:49:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29443 transitions. [2025-01-08 22:49:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:49:47,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:47,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:49:47,605 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash 941567863, now seen corresponding path program 1 times [2025-01-08 22:49:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023259675] [2025-01-08 22:49:47,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:47,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:49:47,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:49:47,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023259675] [2025-01-08 22:49:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023259675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:47,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706844545] [2025-01-08 22:49:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:47,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:47,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:47,635 INFO L87 Difference]: Start difference. First operand 20485 states and 29443 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-08 22:49:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:47,977 INFO L93 Difference]: Finished difference Result 35593 states and 52229 transitions. [2025-01-08 22:49:47,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:47,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2025-01-08 22:49:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:48,036 INFO L225 Difference]: With dead ends: 35593 [2025-01-08 22:49:48,037 INFO L226 Difference]: Without dead ends: 35591 [2025-01-08 22:49:48,047 INFO L434 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 [2025-01-08 22:49:48,047 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:48,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35591 states. [2025-01-08 22:49:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35591 to 30469. [2025-01-08 22:49:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30469 states, 30468 states have (on average 1.3948733097019823) internal successors, (42499), 30468 states have internal predecessors, (42499), 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) [2025-01-08 22:49:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30469 states to 30469 states and 42499 transitions. [2025-01-08 22:49:48,638 INFO L78 Accepts]: Start accepts. Automaton has 30469 states and 42499 transitions. Word has length 30 [2025-01-08 22:49:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:48,638 INFO L471 AbstractCegarLoop]: Abstraction has 30469 states and 42499 transitions. [2025-01-08 22:49:48,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-08 22:49:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30469 states and 42499 transitions. [2025-01-08 22:49:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:49:48,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:48,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:48,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:49:48,665 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash -646780039, now seen corresponding path program 1 times [2025-01-08 22:49:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744826683] [2025-01-08 22:49:48,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:49:48,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:49:48,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:48,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744826683] [2025-01-08 22:49:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744826683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916010158] [2025-01-08 22:49:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:48,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:48,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:48,692 INFO L87 Difference]: Start difference. First operand 30469 states and 42499 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-08 22:49:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:48,972 INFO L93 Difference]: Finished difference Result 70409 states and 98821 transitions. [2025-01-08 22:49:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2025-01-08 22:49:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:49,035 INFO L225 Difference]: With dead ends: 70409 [2025-01-08 22:49:49,036 INFO L226 Difference]: Without dead ends: 40199 [2025-01-08 22:49:49,063 INFO L434 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 [2025-01-08 22:49:49,063 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:49,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40199 states. [2025-01-08 22:49:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40199 to 40197. [2025-01-08 22:49:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40197 states, 40196 states have (on average 1.3884714897004677) internal successors, (55811), 40196 states have internal predecessors, (55811), 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) [2025-01-08 22:49:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40197 states to 40197 states and 55811 transitions. [2025-01-08 22:49:49,651 INFO L78 Accepts]: Start accepts. Automaton has 40197 states and 55811 transitions. Word has length 30 [2025-01-08 22:49:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:49,651 INFO L471 AbstractCegarLoop]: Abstraction has 40197 states and 55811 transitions. [2025-01-08 22:49:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-08 22:49:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40197 states and 55811 transitions. [2025-01-08 22:49:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:49:49,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:49,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:49:49,668 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -875952203, now seen corresponding path program 1 times [2025-01-08 22:49:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:49,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164063097] [2025-01-08 22:49:49,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:49,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:49:49,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:49:49,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164063097] [2025-01-08 22:49:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164063097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:49,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877006905] [2025-01-08 22:49:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:49,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:49,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:49,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:49,686 INFO L87 Difference]: Start difference. First operand 40197 states and 55811 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:50,026 INFO L93 Difference]: Finished difference Result 60681 states and 84229 transitions. [2025-01-08 22:49:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:50,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2025-01-08 22:49:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:50,083 INFO L225 Difference]: With dead ends: 60681 [2025-01-08 22:49:50,083 INFO L226 Difference]: Without dead ends: 40967 [2025-01-08 22:49:50,095 INFO L434 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 [2025-01-08 22:49:50,096 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:50,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40967 states. [2025-01-08 22:49:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40967 to 40965. [2025-01-08 22:49:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40965 states, 40964 states have (on average 1.3749389708036324) internal successors, (56323), 40964 states have internal predecessors, (56323), 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) [2025-01-08 22:49:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 56323 transitions. [2025-01-08 22:49:50,748 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 56323 transitions. Word has length 31 [2025-01-08 22:49:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 40965 states and 56323 transitions. [2025-01-08 22:49:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 56323 transitions. [2025-01-08 22:49:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:49:50,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:50,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:49:50,767 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1424870387, now seen corresponding path program 1 times [2025-01-08 22:49:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:50,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959856754] [2025-01-08 22:49:50,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:50,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:49:50,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:49:50,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:50,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959856754] [2025-01-08 22:49:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959856754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693763988] [2025-01-08 22:49:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:50,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:50,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:50,787 INFO L87 Difference]: Start difference. First operand 40965 states and 56323 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:51,501 INFO L93 Difference]: Finished difference Result 69641 states and 97285 transitions. [2025-01-08 22:49:51,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:51,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2025-01-08 22:49:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:51,577 INFO L225 Difference]: With dead ends: 69641 [2025-01-08 22:49:51,578 INFO L226 Difference]: Without dead ends: 69639 [2025-01-08 22:49:51,597 INFO L434 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 [2025-01-08 22:49:51,601 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:51,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69639 states. [2025-01-08 22:49:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69639 to 61445. [2025-01-08 22:49:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61445 states, 61444 states have (on average 1.3332953583751057) internal successors, (81923), 61444 states have internal predecessors, (81923), 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) [2025-01-08 22:49:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61445 states to 61445 states and 81923 transitions. [2025-01-08 22:49:52,559 INFO L78 Accepts]: Start accepts. Automaton has 61445 states and 81923 transitions. Word has length 31 [2025-01-08 22:49:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:52,559 INFO L471 AbstractCegarLoop]: Abstraction has 61445 states and 81923 transitions. [2025-01-08 22:49:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 61445 states and 81923 transitions. [2025-01-08 22:49:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:49:52,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:52,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:49:52,583 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:52,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -163477515, now seen corresponding path program 1 times [2025-01-08 22:49:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494387765] [2025-01-08 22:49:52,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:52,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:49:52,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:49:52,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:52,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494387765] [2025-01-08 22:49:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494387765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101441465] [2025-01-08 22:49:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:52,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:52,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:52,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:52,600 INFO L87 Difference]: Start difference. First operand 61445 states and 81923 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:53,263 INFO L93 Difference]: Finished difference Result 140297 states and 187397 transitions. [2025-01-08 22:49:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2025-01-08 22:49:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:53,329 INFO L225 Difference]: With dead ends: 140297 [2025-01-08 22:49:53,329 INFO L226 Difference]: Without dead ends: 79879 [2025-01-08 22:49:53,358 INFO L434 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 [2025-01-08 22:49:53,359 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:53,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2025-01-08 22:49:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79877. [2025-01-08 22:49:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.320484250588412) internal successors, (105475), 79876 states have internal predecessors, (105475), 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) [2025-01-08 22:49:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 105475 transitions. [2025-01-08 22:49:54,750 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 105475 transitions. Word has length 31 [2025-01-08 22:49:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:54,750 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 105475 transitions. [2025-01-08 22:49:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-08 22:49:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 105475 transitions. [2025-01-08 22:49:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:49:54,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:54,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:54,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 22:49:54,786 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:54,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1221524494, now seen corresponding path program 1 times [2025-01-08 22:49:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102830131] [2025-01-08 22:49:54,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:54,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:49:54,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:49:54,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102830131] [2025-01-08 22:49:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102830131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462388] [2025-01-08 22:49:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:54,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:54,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:54,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:54,803 INFO L87 Difference]: Start difference. First operand 79877 states and 105475 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:49:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:55,599 INFO L93 Difference]: Finished difference Result 119817 states and 157701 transitions. [2025-01-08 22:49:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2025-01-08 22:49:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:55,664 INFO L225 Difference]: With dead ends: 119817 [2025-01-08 22:49:55,664 INFO L226 Difference]: Without dead ends: 80903 [2025-01-08 22:49:55,682 INFO L434 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 [2025-01-08 22:49:55,683 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:55,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80903 states. [2025-01-08 22:49:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80903 to 80901. [2025-01-08 22:49:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80901 states, 80900 states have (on average 1.303770086526576) internal successors, (105475), 80900 states have internal predecessors, (105475), 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) [2025-01-08 22:49:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80901 states to 80901 states and 105475 transitions. [2025-01-08 22:49:56,868 INFO L78 Accepts]: Start accepts. Automaton has 80901 states and 105475 transitions. Word has length 32 [2025-01-08 22:49:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:56,868 INFO L471 AbstractCegarLoop]: Abstraction has 80901 states and 105475 transitions. [2025-01-08 22:49:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:49:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 80901 states and 105475 transitions. [2025-01-08 22:49:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:49:56,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:56,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-08 22:49:56,903 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -772620212, now seen corresponding path program 1 times [2025-01-08 22:49:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:56,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742576028] [2025-01-08 22:49:56,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:56,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:49:56,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:49:56,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:56,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:56,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742576028] [2025-01-08 22:49:56,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742576028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:56,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:56,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165359770] [2025-01-08 22:49:56,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:56,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:56,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:56,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:56,923 INFO L87 Difference]: Start difference. First operand 80901 states and 105475 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:49:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,511 INFO L93 Difference]: Finished difference Result 135177 states and 178181 transitions. [2025-01-08 22:49:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2025-01-08 22:49:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,649 INFO L225 Difference]: With dead ends: 135177 [2025-01-08 22:49:58,649 INFO L226 Difference]: Without dead ends: 135175 [2025-01-08 22:49:58,672 INFO L434 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 [2025-01-08 22:49:58,673 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 35 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135175 states. [2025-01-08 22:49:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135175 to 122885. [2025-01-08 22:50:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122885 states, 122884 states have (on average 1.2666498486377396) internal successors, (155651), 122884 states have internal predecessors, (155651), 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) [2025-01-08 22:50:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122885 states to 122885 states and 155651 transitions. [2025-01-08 22:50:00,344 INFO L78 Accepts]: Start accepts. Automaton has 122885 states and 155651 transitions. Word has length 32 [2025-01-08 22:50:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:00,344 INFO L471 AbstractCegarLoop]: Abstraction has 122885 states and 155651 transitions. [2025-01-08 22:50:00,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:50:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 122885 states and 155651 transitions. [2025-01-08 22:50:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:50:00,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:00,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:50:00,387 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1933999182, now seen corresponding path program 1 times [2025-01-08 22:50:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399969266] [2025-01-08 22:50:00,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:00,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:50:00,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:50:00,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:00,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399969266] [2025-01-08 22:50:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399969266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062858079] [2025-01-08 22:50:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:00,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:00,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,401 INFO L87 Difference]: Start difference. First operand 122885 states and 155651 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:50:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:02,046 INFO L93 Difference]: Finished difference Result 278537 states and 352261 transitions. [2025-01-08 22:50:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2025-01-08 22:50:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:02,197 INFO L225 Difference]: With dead ends: 278537 [2025-01-08 22:50:02,198 INFO L226 Difference]: Without dead ends: 157703 [2025-01-08 22:50:02,259 INFO L434 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 [2025-01-08 22:50:02,260 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:02,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157703 states. [2025-01-08 22:50:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157703 to 157701. [2025-01-08 22:50:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157701 states, 157700 states have (on average 1.2467406467977171) internal successors, (196611), 157700 states have internal predecessors, (196611), 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) [2025-01-08 22:50:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157701 states to 157701 states and 196611 transitions. [2025-01-08 22:50:04,974 INFO L78 Accepts]: Start accepts. Automaton has 157701 states and 196611 transitions. Word has length 32 [2025-01-08 22:50:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:04,974 INFO L471 AbstractCegarLoop]: Abstraction has 157701 states and 196611 transitions. [2025-01-08 22:50:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2025-01-08 22:50:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 157701 states and 196611 transitions. [2025-01-08 22:50:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:50:05,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:05,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:05,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-08 22:50:05,046 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:05,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1818793002, now seen corresponding path program 1 times [2025-01-08 22:50:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852259423] [2025-01-08 22:50:05,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:05,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:50:05,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:50:05,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:05,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852259423] [2025-01-08 22:50:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852259423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:05,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:05,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21598424] [2025-01-08 22:50:05,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:05,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:05,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:05,063 INFO L87 Difference]: Start difference. First operand 157701 states and 196611 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2025-01-08 22:50:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:06,842 INFO L93 Difference]: Finished difference Result 236553 states and 293893 transitions. [2025-01-08 22:50:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2025-01-08 22:50:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:06,987 INFO L225 Difference]: With dead ends: 236553 [2025-01-08 22:50:06,988 INFO L226 Difference]: Without dead ends: 159751 [2025-01-08 22:50:07,037 INFO L434 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 [2025-01-08 22:50:07,038 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:07,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159751 states.