./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i -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 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:20:10,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:20:10,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:20:10,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:20:10,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:20:10,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:20:10,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:20:10,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:20:10,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:20:10,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:20:10,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:20:10,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:20:10,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:20:10,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:20:10,713 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:20:10,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:20:10,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:20:10,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:20:10,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:20:10,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:20:10,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:20:10,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:20:10,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:20:10,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:20:10,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:20:10,716 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 -> 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 [2025-01-09 10:20:10,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:20:10,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:20:10,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:20:10,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:20:10,957 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:20:10,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2025-01-09 10:20:12,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8149f2874/d4f2b9772d624b5da355f82a757270f6/FLAG8b97cd88b [2025-01-09 10:20:12,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:20:12,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2025-01-09 10:20:12,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8149f2874/d4f2b9772d624b5da355f82a757270f6/FLAG8b97cd88b [2025-01-09 10:20:12,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8149f2874/d4f2b9772d624b5da355f82a757270f6 [2025-01-09 10:20:12,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:20:12,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:20:12,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:20:12,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:20:12,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:20:12,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300332b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12, skipping insertion in model container [2025-01-09 10:20:12,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:20:12,717 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i[915,928] [2025-01-09 10:20:12,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:20:12,817 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:20:12,826 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i[915,928] [2025-01-09 10:20:12,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:20:12,875 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:20:12,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12 WrapperNode [2025-01-09 10:20:12,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:20:12,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:20:12,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:20:12,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:20:12,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,927 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-01-09 10:20:12,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:20:12,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:20:12,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:20:12,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:20:12,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,948 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-09 10:20:12,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:20:12,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:20:12,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:20:12,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:20:12,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (1/1) ... [2025-01-09 10:20:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:20:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:20:12,990 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-09 10:20:12,992 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-09 10:20:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:20:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:20:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:20:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:20:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:20:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:20:13,065 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:20:13,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:20:13,444 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:20:13,444 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:20:13,460 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:20:13,460 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:20:13,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:20:13 BoogieIcfgContainer [2025-01-09 10:20:13,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:20:13,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:20:13,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:20:13,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:20:13,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:20:12" (1/3) ... [2025-01-09 10:20:13,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26333f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:20:13, skipping insertion in model container [2025-01-09 10:20:13,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:20:12" (2/3) ... [2025-01-09 10:20:13,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26333f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:20:13, skipping insertion in model container [2025-01-09 10:20:13,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:20:13" (3/3) ... [2025-01-09 10:20:13,471 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2025-01-09 10:20:13,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:20:13,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:20:13,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:20:13,531 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;@2472dffc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:20:13,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:20:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:20:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 10:20:13,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:13,545 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:13,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 885548699, now seen corresponding path program 1 times [2025-01-09 10:20:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968775557] [2025-01-09 10:20:13,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:13,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 10:20:13,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 10:20:13,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968775557] [2025-01-09 10:20:14,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968775557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:14,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:14,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:20:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485694690] [2025-01-09 10:20:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:14,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:20:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:14,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:20:14,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:20:14,656 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:15,004 INFO L93 Difference]: Finished difference Result 388 states and 731 transitions. [2025-01-09 10:20:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:20:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-01-09 10:20:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:15,013 INFO L225 Difference]: With dead ends: 388 [2025-01-09 10:20:15,013 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 10:20:15,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:20:15,017 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 122 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:15,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 501 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:20:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 10:20:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-01-09 10:20:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:20:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2025-01-09 10:20:15,088 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2025-01-09 10:20:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:15,091 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2025-01-09 10:20:15,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2025-01-09 10:20:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:15,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:15,097 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:15,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:20:15,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1287654741, now seen corresponding path program 1 times [2025-01-09 10:20:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840953637] [2025-01-09 10:20:15,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:15,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840953637] [2025-01-09 10:20:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840953637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:16,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:16,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:20:16,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644053437] [2025-01-09 10:20:16,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:20:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:16,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:20:16,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:20:16,156 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:16,964 INFO L93 Difference]: Finished difference Result 821 states and 1299 transitions. [2025-01-09 10:20:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:20:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-01-09 10:20:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:16,969 INFO L225 Difference]: With dead ends: 821 [2025-01-09 10:20:16,969 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 10:20:16,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:20:16,972 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 456 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:16,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 519 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:20:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 10:20:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 278. [2025-01-09 10:20:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 171 states have (on average 1.3742690058479532) internal successors, (235), 171 states have internal predecessors, (235), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:20:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 435 transitions. [2025-01-09 10:20:17,033 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 435 transitions. Word has length 307 [2025-01-09 10:20:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 435 transitions. [2025-01-09 10:20:17,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 435 transitions. [2025-01-09 10:20:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:17,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:17,037 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:17,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:20:17,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:17,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2105303191, now seen corresponding path program 1 times [2025-01-09 10:20:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:17,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232067063] [2025-01-09 10:20:17,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:17,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:17,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:17,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:23,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:23,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232067063] [2025-01-09 10:20:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232067063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:23,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:20:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990801777] [2025-01-09 10:20:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:23,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:20:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:20:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:20:23,958 INFO L87 Difference]: Start difference. First operand 278 states and 435 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:26,840 INFO L93 Difference]: Finished difference Result 941 states and 1458 transitions. [2025-01-09 10:20:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:20:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:20:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:26,847 INFO L225 Difference]: With dead ends: 941 [2025-01-09 10:20:26,847 INFO L226 Difference]: Without dead ends: 666 [2025-01-09 10:20:26,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:20:26,850 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 713 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:26,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1159 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:20:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-01-09 10:20:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 440. [2025-01-09 10:20:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 280 states have (on average 1.4071428571428573) internal successors, (394), 280 states have internal predecessors, (394), 150 states have call successors, (150), 9 states have call predecessors, (150), 9 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 10:20:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 694 transitions. [2025-01-09 10:20:26,921 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 694 transitions. Word has length 307 [2025-01-09 10:20:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:26,922 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 694 transitions. [2025-01-09 10:20:26,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 694 transitions. [2025-01-09 10:20:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:26,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:26,926 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:20:26,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1796637095, now seen corresponding path program 1 times [2025-01-09 10:20:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106926929] [2025-01-09 10:20:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:26,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:26,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:26,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106926929] [2025-01-09 10:20:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106926929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:27,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:27,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:20:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349178912] [2025-01-09 10:20:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:20:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:27,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:20:27,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:20:27,170 INFO L87 Difference]: Start difference. First operand 440 states and 694 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:27,261 INFO L93 Difference]: Finished difference Result 783 states and 1223 transitions. [2025-01-09 10:20:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:20:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:20:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:27,269 INFO L225 Difference]: With dead ends: 783 [2025-01-09 10:20:27,269 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 10:20:27,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:20:27,271 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 42 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:27,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 614 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:20:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 10:20:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2025-01-09 10:20:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 334 states have (on average 1.3952095808383234) internal successors, (466), 336 states have internal predecessors, (466), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 782 transitions. [2025-01-09 10:20:27,333 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 782 transitions. Word has length 307 [2025-01-09 10:20:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:27,333 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 782 transitions. [2025-01-09 10:20:27,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 782 transitions. [2025-01-09 10:20:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:27,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:27,336 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:27,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:20:27,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:27,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1404238613, now seen corresponding path program 1 times [2025-01-09 10:20:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113621649] [2025-01-09 10:20:27,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:27,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:27,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113621649] [2025-01-09 10:20:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113621649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:20:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563494532] [2025-01-09 10:20:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:32,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:20:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:32,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:20:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:20:32,974 INFO L87 Difference]: Start difference. First operand 504 states and 782 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:34,201 INFO L93 Difference]: Finished difference Result 919 states and 1408 transitions. [2025-01-09 10:20:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:20:34,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:20:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:34,207 INFO L225 Difference]: With dead ends: 919 [2025-01-09 10:20:34,208 INFO L226 Difference]: Without dead ends: 580 [2025-01-09 10:20:34,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:20:34,212 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 156 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:34,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 882 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:20:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-09 10:20:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 362. [2025-01-09 10:20:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.3755102040816327) internal successors, (337), 247 states have internal predecessors, (337), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 10:20:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 553 transitions. [2025-01-09 10:20:34,263 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 553 transitions. Word has length 307 [2025-01-09 10:20:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:34,264 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 553 transitions. [2025-01-09 10:20:34,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 553 transitions. [2025-01-09 10:20:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:34,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:34,269 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:20:34,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1847137753, now seen corresponding path program 1 times [2025-01-09 10:20:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598051452] [2025-01-09 10:20:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:34,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:34,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:35,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598051452] [2025-01-09 10:20:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598051452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:20:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568867057] [2025-01-09 10:20:35,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:35,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:20:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:35,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:20:35,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:20:35,285 INFO L87 Difference]: Start difference. First operand 362 states and 553 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:36,552 INFO L93 Difference]: Finished difference Result 1151 states and 1751 transitions. [2025-01-09 10:20:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:20:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-01-09 10:20:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:36,560 INFO L225 Difference]: With dead ends: 1151 [2025-01-09 10:20:36,561 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 10:20:36,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:20:36,564 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 416 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1117 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:20:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 10:20:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 512. [2025-01-09 10:20:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 342 states have (on average 1.391812865497076) internal successors, (476), 344 states have internal predecessors, (476), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 792 transitions. [2025-01-09 10:20:36,643 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 792 transitions. Word has length 307 [2025-01-09 10:20:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 792 transitions. [2025-01-09 10:20:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 792 transitions. [2025-01-09 10:20:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:20:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:36,651 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:20:36,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1436712293, now seen corresponding path program 1 times [2025-01-09 10:20:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484177840] [2025-01-09 10:20:36,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:20:36,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:20:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:37,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484177840] [2025-01-09 10:20:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484177840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:37,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:20:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313757725] [2025-01-09 10:20:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:37,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:20:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:20:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:20:37,143 INFO L87 Difference]: Start difference. First operand 512 states and 792 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:37,691 INFO L93 Difference]: Finished difference Result 975 states and 1493 transitions. [2025-01-09 10:20:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:20:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:20:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:37,696 INFO L225 Difference]: With dead ends: 975 [2025-01-09 10:20:37,696 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 10:20:37,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:20:37,697 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 210 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:37,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 779 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:20:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 10:20:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 512. [2025-01-09 10:20:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 342 states have (on average 1.391812865497076) internal successors, (476), 344 states have internal predecessors, (476), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 792 transitions. [2025-01-09 10:20:37,756 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 792 transitions. Word has length 307 [2025-01-09 10:20:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:37,756 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 792 transitions. [2025-01-09 10:20:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 792 transitions. [2025-01-09 10:20:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:20:37,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:37,759 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:37,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:20:37,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:37,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 268149397, now seen corresponding path program 1 times [2025-01-09 10:20:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268831476] [2025-01-09 10:20:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:37,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:20:37,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:20:37,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:37,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268831476] [2025-01-09 10:20:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268831476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:20:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389395804] [2025-01-09 10:20:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:20:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:20:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:20:44,334 INFO L87 Difference]: Start difference. First operand 512 states and 792 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:45,104 INFO L93 Difference]: Finished difference Result 1145 states and 1732 transitions. [2025-01-09 10:20:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:20:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:20:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:45,108 INFO L225 Difference]: With dead ends: 1145 [2025-01-09 10:20:45,109 INFO L226 Difference]: Without dead ends: 786 [2025-01-09 10:20:45,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:20:45,110 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:45,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 894 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:20:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-01-09 10:20:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 528. [2025-01-09 10:20:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 358 states have (on average 1.4022346368715084) internal successors, (502), 360 states have internal predecessors, (502), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 818 transitions. [2025-01-09 10:20:45,168 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 818 transitions. Word has length 308 [2025-01-09 10:20:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 818 transitions. [2025-01-09 10:20:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 818 transitions. [2025-01-09 10:20:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:20:45,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:45,170 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:20:45,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -124877613, now seen corresponding path program 1 times [2025-01-09 10:20:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863794355] [2025-01-09 10:20:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:45,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:20:45,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:20:45,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:45,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863794355] [2025-01-09 10:20:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863794355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:50,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:50,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:20:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051026198] [2025-01-09 10:20:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:20:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:50,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:20:50,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:20:50,526 INFO L87 Difference]: Start difference. First operand 528 states and 818 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:51,987 INFO L93 Difference]: Finished difference Result 1139 states and 1730 transitions. [2025-01-09 10:20:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:20:51,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:20:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:51,991 INFO L225 Difference]: With dead ends: 1139 [2025-01-09 10:20:51,991 INFO L226 Difference]: Without dead ends: 770 [2025-01-09 10:20:51,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:20:51,994 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 283 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:51,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1080 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:20:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-09 10:20:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 548. [2025-01-09 10:20:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 378 states have (on average 1.4074074074074074) internal successors, (532), 380 states have internal predecessors, (532), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 848 transitions. [2025-01-09 10:20:52,054 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 848 transitions. Word has length 308 [2025-01-09 10:20:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 848 transitions. [2025-01-09 10:20:52,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:20:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 848 transitions. [2025-01-09 10:20:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:20:52,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:52,056 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:52,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:20:52,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 969213975, now seen corresponding path program 1 times [2025-01-09 10:20:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211331114] [2025-01-09 10:20:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:52,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:20:52,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:20:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:20:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:20:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:20:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211331114] [2025-01-09 10:20:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211331114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:20:55,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:20:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:20:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649378561] [2025-01-09 10:20:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:20:55,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:20:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:20:55,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:20:55,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:20:55,652 INFO L87 Difference]: Start difference. First operand 548 states and 848 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:20:57,382 INFO L93 Difference]: Finished difference Result 1227 states and 1854 transitions. [2025-01-09 10:20:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:20:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-01-09 10:20:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:20:57,392 INFO L225 Difference]: With dead ends: 1227 [2025-01-09 10:20:57,395 INFO L226 Difference]: Without dead ends: 858 [2025-01-09 10:20:57,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:20:57,397 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 474 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:20:57,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1369 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:20:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-01-09 10:20:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 554. [2025-01-09 10:20:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 384 states have (on average 1.40625) internal successors, (540), 386 states have internal predecessors, (540), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:20:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 856 transitions. [2025-01-09 10:20:57,483 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 856 transitions. Word has length 308 [2025-01-09 10:20:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:20:57,484 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 856 transitions. [2025-01-09 10:20:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:20:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 856 transitions. [2025-01-09 10:20:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:20:57,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:20:57,485 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:20:57,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:20:57,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:20:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:20:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash 576186965, now seen corresponding path program 1 times [2025-01-09 10:20:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:20:57,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601705696] [2025-01-09 10:20:57,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:20:57,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:20:57,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:20:57,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:20:57,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:20:57,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:21:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:21:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:21:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601705696] [2025-01-09 10:21:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601705696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:21:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:21:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:21:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868491910] [2025-01-09 10:21:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:21:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:21:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:21:02,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:21:02,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:21:02,317 INFO L87 Difference]: Start difference. First operand 554 states and 856 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:21:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:21:04,564 INFO L93 Difference]: Finished difference Result 1111 states and 1691 transitions. [2025-01-09 10:21:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:21:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-01-09 10:21:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:21:04,570 INFO L225 Difference]: With dead ends: 1111 [2025-01-09 10:21:04,570 INFO L226 Difference]: Without dead ends: 742 [2025-01-09 10:21:04,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:21:04,572 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 332 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:21:04,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1325 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:21:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-01-09 10:21:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 556. [2025-01-09 10:21:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 386 states have (on average 1.4093264248704662) internal successors, (544), 388 states have internal predecessors, (544), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:21:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 860 transitions. [2025-01-09 10:21:04,632 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 860 transitions. Word has length 308 [2025-01-09 10:21:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:21:04,633 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 860 transitions. [2025-01-09 10:21:04,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:21:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 860 transitions. [2025-01-09 10:21:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:21:04,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:21:04,635 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:21:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:21:04,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:21:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:21:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -41903275, now seen corresponding path program 1 times [2025-01-09 10:21:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:21:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302750489] [2025-01-09 10:21:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:21:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:21:04,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:21:04,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:21:04,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:21:04,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:21:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:21:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:21:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302750489] [2025-01-09 10:21:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302750489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:21:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:21:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:21:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320359381] [2025-01-09 10:21:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:21:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:21:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:21:08,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:21:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:21:08,592 INFO L87 Difference]: Start difference. First operand 556 states and 860 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:21:09,040 INFO L93 Difference]: Finished difference Result 1095 states and 1669 transitions. [2025-01-09 10:21:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:21:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:21:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:21:09,044 INFO L225 Difference]: With dead ends: 1095 [2025-01-09 10:21:09,044 INFO L226 Difference]: Without dead ends: 726 [2025-01-09 10:21:09,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:21:09,046 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 189 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:21:09,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 913 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:21:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-01-09 10:21:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 548. [2025-01-09 10:21:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 378 states have (on average 1.4074074074074074) internal successors, (532), 380 states have internal predecessors, (532), 158 states have call successors, (158), 11 states have call predecessors, (158), 11 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:21:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 848 transitions. [2025-01-09 10:21:09,107 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 848 transitions. Word has length 308 [2025-01-09 10:21:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:21:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 848 transitions. [2025-01-09 10:21:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 848 transitions. [2025-01-09 10:21:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:21:09,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:21:09,109 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:21:09,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:21:09,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:21:09,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:21:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1011714281, now seen corresponding path program 1 times [2025-01-09 10:21:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:21:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237816053] [2025-01-09 10:21:09,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:21:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:21:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:21:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:21:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:21:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:21:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:21:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:21:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237816053] [2025-01-09 10:21:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237816053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:21:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:21:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:21:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741676217] [2025-01-09 10:21:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:21:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:21:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:21:09,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:21:09,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:21:09,276 INFO L87 Difference]: Start difference. First operand 548 states and 848 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:21:09,384 INFO L93 Difference]: Finished difference Result 965 states and 1476 transitions. [2025-01-09 10:21:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:21:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:21:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:21:09,388 INFO L225 Difference]: With dead ends: 965 [2025-01-09 10:21:09,388 INFO L226 Difference]: Without dead ends: 596 [2025-01-09 10:21:09,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:21:09,389 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 61 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:21:09,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 623 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:21:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-01-09 10:21:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 518. [2025-01-09 10:21:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 355 states have (on average 1.4112676056338027) internal successors, (501), 355 states have internal predecessors, (501), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 10:21:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 801 transitions. [2025-01-09 10:21:09,444 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 801 transitions. Word has length 308 [2025-01-09 10:21:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:21:09,444 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 801 transitions. [2025-01-09 10:21:09,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 801 transitions. [2025-01-09 10:21:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:21:09,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:21:09,446 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:21:09,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:21:09,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:21:09,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:21:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1404741291, now seen corresponding path program 1 times [2025-01-09 10:21:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:21:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165391389] [2025-01-09 10:21:09,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:21:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:21:09,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:21:09,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:21:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:21:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:21:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:21:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:21:13,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165391389] [2025-01-09 10:21:13,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165391389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:21:13,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:21:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:21:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303705757] [2025-01-09 10:21:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:21:13,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:21:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:21:13,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:21:13,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:21:13,939 INFO L87 Difference]: Start difference. First operand 518 states and 801 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:21:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:21:15,369 INFO L93 Difference]: Finished difference Result 1019 states and 1541 transitions. [2025-01-09 10:21:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:21:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-01-09 10:21:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:21:15,373 INFO L225 Difference]: With dead ends: 1019 [2025-01-09 10:21:15,374 INFO L226 Difference]: Without dead ends: 680 [2025-01-09 10:21:15,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:21:15,375 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 332 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:21:15,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1366 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:21:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-01-09 10:21:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 526. [2025-01-09 10:21:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 363 states have (on average 1.4077134986225894) internal successors, (511), 363 states have internal predecessors, (511), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 10:21:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 811 transitions. [2025-01-09 10:21:15,431 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 811 transitions. Word has length 308 [2025-01-09 10:21:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:21:15,432 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 811 transitions. [2025-01-09 10:21:15,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:21:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 811 transitions. [2025-01-09 10:21:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:21:15,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:21:15,433 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:21:15,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:21:15,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:21:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:21:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -703676713, now seen corresponding path program 1 times [2025-01-09 10:21:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:21:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725537944] [2025-01-09 10:21:15,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:21:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:21:15,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:21:15,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:21:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:21:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:21:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:21:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:21:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725537944] [2025-01-09 10:21:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725537944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:21:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:21:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:21:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42087073] [2025-01-09 10:21:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:21:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:21:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:21:21,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:21:21,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:21:21,353 INFO L87 Difference]: Start difference. First operand 526 states and 811 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:21:22,307 INFO L93 Difference]: Finished difference Result 957 states and 1459 transitions. [2025-01-09 10:21:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:21:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:21:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:21:22,311 INFO L225 Difference]: With dead ends: 957 [2025-01-09 10:21:22,311 INFO L226 Difference]: Without dead ends: 618 [2025-01-09 10:21:22,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:21:22,312 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 106 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:21:22,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1092 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:21:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-01-09 10:21:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 522. [2025-01-09 10:21:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 359 states have (on average 1.4122562674094707) internal successors, (507), 359 states have internal predecessors, (507), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 10:21:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 807 transitions. [2025-01-09 10:21:22,375 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 807 transitions. Word has length 308 [2025-01-09 10:21:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:21:22,376 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 807 transitions. [2025-01-09 10:21:22,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:21:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 807 transitions. [2025-01-09 10:21:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 10:21:22,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:21:22,377 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:21:22,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:21:22,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:21:22,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:21:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1100917820, now seen corresponding path program 1 times [2025-01-09 10:21:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:21:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210510511] [2025-01-09 10:21:22,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:21:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:21:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 10:21:22,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 10:21:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:21:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat