./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-13.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_operatoramount_amount500_file-13.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 d5194ca2a271eb4c42f992f5d7dece7ecd9a6b07ea3e315005d3dcdd4e1a968f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:43:30,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:43:30,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:43:30,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:43:30,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:43:30,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:43:30,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:43:30,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:43:30,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:43:30,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:43:30,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:43:30,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:43:30,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:43:30,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:43:30,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:43:30,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:43:30,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:43:30,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:43:30,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:43:30,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:43:30,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:43:30,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:30,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:30,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:30,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:30,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:43:30,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:30,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:43:30,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:43:30,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:43:30,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:43:30,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:43:30,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:43:30,976 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 -> d5194ca2a271eb4c42f992f5d7dece7ecd9a6b07ea3e315005d3dcdd4e1a968f [2025-01-09 14:43:31,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:43:31,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:43:31,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:43:31,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:43:31,239 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:43:31,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-13.i [2025-01-09 14:43:32,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bbb583be/955d43cb4cf948e19438919f3e493888/FLAG3c13ad032 [2025-01-09 14:43:32,837 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:43:32,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-13.i [2025-01-09 14:43:32,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bbb583be/955d43cb4cf948e19438919f3e493888/FLAG3c13ad032 [2025-01-09 14:43:33,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bbb583be/955d43cb4cf948e19438919f3e493888 [2025-01-09 14:43:33,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:43:33,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:43:33,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:33,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:43:33,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:43:33,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33, skipping insertion in model container [2025-01-09 14:43:33,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:43:33,270 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_operatoramount_amount500_file-13.i[916,929] [2025-01-09 14:43:33,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:33,489 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:43:33,498 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_operatoramount_amount500_file-13.i[916,929] [2025-01-09 14:43:33,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:33,629 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:43:33,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33 WrapperNode [2025-01-09 14:43:33,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:33,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:33,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:43:33,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:43:33,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,737 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 717 [2025-01-09 14:43:33,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:33,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:43:33,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:43:33,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:43:33,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,858 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 14:43:33,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:43:33,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:43:33,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:43:33,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:43:33,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (1/1) ... [2025-01-09 14:43:33,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:33,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:33,985 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 14:43:33,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 14:43:34,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:43:34,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:43:34,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:43:34,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:43:34,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:43:34,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:43:34,158 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:43:34,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:43:35,487 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-01-09 14:43:35,489 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:43:35,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:43:35,513 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:43:35,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:35 BoogieIcfgContainer [2025-01-09 14:43:35,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:43:35,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:43:35,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:43:35,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:43:35,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:43:33" (1/3) ... [2025-01-09 14:43:35,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c094f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:35, skipping insertion in model container [2025-01-09 14:43:35,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:33" (2/3) ... [2025-01-09 14:43:35,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c094f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:35, skipping insertion in model container [2025-01-09 14:43:35,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:35" (3/3) ... [2025-01-09 14:43:35,525 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-13.i [2025-01-09 14:43:35,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:43:35,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-13.i that has 2 procedures, 292 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:43:35,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:43:35,612 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;@335b1231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:43:35,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:43:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 210 states have (on average 1.5523809523809524) internal successors, (326), 211 states have internal predecessors, (326), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:43:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:43:35,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:35,663 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:35,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 157047791, now seen corresponding path program 1 times [2025-01-09 14:43:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959854768] [2025-01-09 14:43:35,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:35,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:43:35,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:43:35,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 14:43:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959854768] [2025-01-09 14:43:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959854768] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179131736] [2025-01-09 14:43:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:36,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:36,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:43:36,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:43:36,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:43:36,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:43:36,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:36,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:43:36,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 14:43:37,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:43:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179131736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:43:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:43:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066852708] [2025-01-09 14:43:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:37,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:43:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:37,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:43:37,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:37,036 INFO L87 Difference]: Start difference. First operand has 292 states, 210 states have (on average 1.5523809523809524) internal successors, (326), 211 states have internal predecessors, (326), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:37,094 INFO L93 Difference]: Finished difference Result 576 states and 1038 transitions. [2025-01-09 14:43:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:43:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 531 [2025-01-09 14:43:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:37,105 INFO L225 Difference]: With dead ends: 576 [2025-01-09 14:43:37,105 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 14:43:37,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:37,113 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:37,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 14:43:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-01-09 14:43:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 206 states have (on average 1.5339805825242718) internal successors, (316), 206 states have internal predecessors, (316), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:43:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 474 transitions. [2025-01-09 14:43:37,198 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 474 transitions. Word has length 531 [2025-01-09 14:43:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 474 transitions. [2025-01-09 14:43:37,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 474 transitions. [2025-01-09 14:43:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:43:37,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:37,214 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:37,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:43:37,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:43:37,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1738072195, now seen corresponding path program 1 times [2025-01-09 14:43:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376847702] [2025-01-09 14:43:37,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:37,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:43:37,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:43:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376847702] [2025-01-09 14:43:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376847702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:38,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:38,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056092594] [2025-01-09 14:43:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:38,238 INFO L87 Difference]: Start difference. First operand 287 states and 474 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:38,393 INFO L93 Difference]: Finished difference Result 747 states and 1236 transitions. [2025-01-09 14:43:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 531 [2025-01-09 14:43:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:38,403 INFO L225 Difference]: With dead ends: 747 [2025-01-09 14:43:38,403 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 14:43:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:38,406 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 275 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:38,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 915 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 14:43:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2025-01-09 14:43:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 362 states have (on average 1.5718232044198894) internal successors, (569), 363 states have internal predecessors, (569), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 14:43:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 759 transitions. [2025-01-09 14:43:38,473 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 759 transitions. Word has length 531 [2025-01-09 14:43:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:38,476 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 759 transitions. [2025-01-09 14:43:38,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 759 transitions. [2025-01-09 14:43:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:43:38,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:38,489 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:38,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:43:38,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2064268927, now seen corresponding path program 1 times [2025-01-09 14:43:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559885620] [2025-01-09 14:43:38,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:38,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:43:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:43:38,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559885620] [2025-01-09 14:43:39,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559885620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:39,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:39,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519887444] [2025-01-09 14:43:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:39,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:39,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:39,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:39,135 INFO L87 Difference]: Start difference. First operand 460 states and 759 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:39,283 INFO L93 Difference]: Finished difference Result 1368 states and 2260 transitions. [2025-01-09 14:43:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 531 [2025-01-09 14:43:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:39,299 INFO L225 Difference]: With dead ends: 1368 [2025-01-09 14:43:39,300 INFO L226 Difference]: Without dead ends: 911 [2025-01-09 14:43:39,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:39,303 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 443 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:39,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 914 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-01-09 14:43:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 909. [2025-01-09 14:43:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 714 states have (on average 1.5588235294117647) internal successors, (1113), 716 states have internal predecessors, (1113), 190 states have call successors, (190), 4 states have call predecessors, (190), 4 states have return successors, (190), 188 states have call predecessors, (190), 190 states have call successors, (190) [2025-01-09 14:43:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1493 transitions. [2025-01-09 14:43:39,419 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1493 transitions. Word has length 531 [2025-01-09 14:43:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1493 transitions. [2025-01-09 14:43:39,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1493 transitions. [2025-01-09 14:43:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:43:39,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:39,433 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:43:39,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:39,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash -82957308, now seen corresponding path program 1 times [2025-01-09 14:43:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984169070] [2025-01-09 14:43:39,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:39,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:43:39,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:43:39,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:39,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984169070] [2025-01-09 14:43:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984169070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908029722] [2025-01-09 14:43:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:39,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:39,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:39,903 INFO L87 Difference]: Start difference. First operand 909 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:40,042 INFO L93 Difference]: Finished difference Result 2659 states and 4367 transitions. [2025-01-09 14:43:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 532 [2025-01-09 14:43:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:40,060 INFO L225 Difference]: With dead ends: 2659 [2025-01-09 14:43:40,060 INFO L226 Difference]: Without dead ends: 1753 [2025-01-09 14:43:40,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:40,065 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 425 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:40,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 931 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-01-09 14:43:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1033. [2025-01-09 14:43:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 838 states have (on average 1.5859188544152745) internal successors, (1329), 840 states have internal predecessors, (1329), 190 states have call successors, (190), 4 states have call predecessors, (190), 4 states have return successors, (190), 188 states have call predecessors, (190), 190 states have call successors, (190) [2025-01-09 14:43:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1709 transitions. [2025-01-09 14:43:40,282 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1709 transitions. Word has length 532 [2025-01-09 14:43:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:40,284 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1709 transitions. [2025-01-09 14:43:40,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1709 transitions. [2025-01-09 14:43:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:43:40,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:40,298 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:43:40,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -477324094, now seen corresponding path program 1 times [2025-01-09 14:43:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255791592] [2025-01-09 14:43:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:43:40,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:43:40,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:40,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255791592] [2025-01-09 14:43:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255791592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225080857] [2025-01-09 14:43:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:41,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:41,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:41,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:41,074 INFO L87 Difference]: Start difference. First operand 1033 states and 1709 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:41,621 INFO L93 Difference]: Finished difference Result 2895 states and 4801 transitions. [2025-01-09 14:43:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:43:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 532 [2025-01-09 14:43:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:41,634 INFO L225 Difference]: With dead ends: 2895 [2025-01-09 14:43:41,634 INFO L226 Difference]: Without dead ends: 1865 [2025-01-09 14:43:41,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:43:41,639 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 371 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:41,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1712 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:43:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-01-09 14:43:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1170. [2025-01-09 14:43:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 894 states have (on average 1.551454138702461) internal successors, (1387), 896 states have internal predecessors, (1387), 269 states have call successors, (269), 6 states have call predecessors, (269), 6 states have return successors, (269), 267 states have call predecessors, (269), 269 states have call successors, (269) [2025-01-09 14:43:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1925 transitions. [2025-01-09 14:43:41,793 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1925 transitions. Word has length 532 [2025-01-09 14:43:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:41,795 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1925 transitions. [2025-01-09 14:43:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1925 transitions. [2025-01-09 14:43:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 14:43:41,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:41,810 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:43:41,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1934302239, now seen corresponding path program 1 times [2025-01-09 14:43:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252643025] [2025-01-09 14:43:41,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:41,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:43:41,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:43:41,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:41,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252643025] [2025-01-09 14:43:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252643025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:42,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:42,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438040143] [2025-01-09 14:43:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:42,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:42,829 INFO L87 Difference]: Start difference. First operand 1170 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:42,990 INFO L93 Difference]: Finished difference Result 2202 states and 3632 transitions. [2025-01-09 14:43:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-01-09 14:43:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:43,003 INFO L225 Difference]: With dead ends: 2202 [2025-01-09 14:43:43,004 INFO L226 Difference]: Without dead ends: 1172 [2025-01-09 14:43:43,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:43,009 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 463 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:43,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1183 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-01-09 14:43:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2025-01-09 14:43:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 894 states have (on average 1.5402684563758389) internal successors, (1377), 896 states have internal predecessors, (1377), 269 states have call successors, (269), 6 states have call predecessors, (269), 6 states have return successors, (269), 267 states have call predecessors, (269), 269 states have call successors, (269) [2025-01-09 14:43:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1915 transitions. [2025-01-09 14:43:43,125 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1915 transitions. Word has length 533 [2025-01-09 14:43:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:43,129 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1915 transitions. [2025-01-09 14:43:43,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1915 transitions. [2025-01-09 14:43:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 14:43:43,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:43,140 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:43:43,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:43,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash -191441619, now seen corresponding path program 1 times [2025-01-09 14:43:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724563823] [2025-01-09 14:43:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:43,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:43:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:43:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:45,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:45,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724563823] [2025-01-09 14:43:45,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724563823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:45,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:45,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:43:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696066728] [2025-01-09 14:43:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:43:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:43:45,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:43:45,473 INFO L87 Difference]: Start difference. First operand 1170 states and 1915 transitions. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:48,694 INFO L93 Difference]: Finished difference Result 6842 states and 11077 transitions. [2025-01-09 14:43:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:43:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 533 [2025-01-09 14:43:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:48,728 INFO L225 Difference]: With dead ends: 6842 [2025-01-09 14:43:48,729 INFO L226 Difference]: Without dead ends: 5812 [2025-01-09 14:43:48,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:43:48,737 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 4403 mSDsluCounter, 3626 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:48,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 4326 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 14:43:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2025-01-09 14:43:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 2632. [2025-01-09 14:43:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2157 states have (on average 1.5873898933704218) internal successors, (3424), 2161 states have internal predecessors, (3424), 459 states have call successors, (459), 15 states have call predecessors, (459), 15 states have return successors, (459), 455 states have call predecessors, (459), 459 states have call successors, (459) [2025-01-09 14:43:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4342 transitions. [2025-01-09 14:43:49,039 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4342 transitions. Word has length 533 [2025-01-09 14:43:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:49,040 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 4342 transitions. [2025-01-09 14:43:49,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4342 transitions. [2025-01-09 14:43:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 14:43:49,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:49,052 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:49,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:43:49,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:49,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1194761775, now seen corresponding path program 1 times [2025-01-09 14:43:49,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830884267] [2025-01-09 14:43:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:49,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:43:49,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:43:49,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:49,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830884267] [2025-01-09 14:43:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830884267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:43:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064490994] [2025-01-09 14:43:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:51,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:43:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:51,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:43:51,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:43:51,192 INFO L87 Difference]: Start difference. First operand 2632 states and 4342 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:53,950 INFO L93 Difference]: Finished difference Result 7896 states and 12813 transitions. [2025-01-09 14:43:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:43:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 533 [2025-01-09 14:43:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:53,982 INFO L225 Difference]: With dead ends: 7896 [2025-01-09 14:43:53,983 INFO L226 Difference]: Without dead ends: 5408 [2025-01-09 14:43:53,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:43:53,992 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 3430 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3430 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:53,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3430 Valid, 3309 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:43:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2025-01-09 14:43:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 3704. [2025-01-09 14:43:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 3133 states have (on average 1.5857006064474943) internal successors, (4968), 3141 states have internal predecessors, (4968), 543 states have call successors, (543), 27 states have call predecessors, (543), 27 states have return successors, (543), 535 states have call predecessors, (543), 543 states have call successors, (543) [2025-01-09 14:43:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 6054 transitions. [2025-01-09 14:43:54,264 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 6054 transitions. Word has length 533 [2025-01-09 14:43:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:54,267 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 6054 transitions. [2025-01-09 14:43:54,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:43:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 6054 transitions. [2025-01-09 14:43:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:43:54,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:54,275 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:54,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:43:54,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2065291634, now seen corresponding path program 1 times [2025-01-09 14:43:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726426791] [2025-01-09 14:43:54,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:54,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:43:54,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:43:54,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:54,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726426791] [2025-01-09 14:43:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726426791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686629443] [2025-01-09 14:43:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:56,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:56,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:56,341 INFO L87 Difference]: Start difference. First operand 3704 states and 6054 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:57,133 INFO L93 Difference]: Finished difference Result 11420 states and 18785 transitions. [2025-01-09 14:43:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:43:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:43:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:57,187 INFO L225 Difference]: With dead ends: 11420 [2025-01-09 14:43:57,187 INFO L226 Difference]: Without dead ends: 7868 [2025-01-09 14:43:57,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:43:57,203 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 566 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:57,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1839 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:43:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2025-01-09 14:43:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7396. [2025-01-09 14:43:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7396 states, 6439 states have (on average 1.6139152042242584) internal successors, (10392), 6449 states have internal predecessors, (10392), 911 states have call successors, (911), 45 states have call predecessors, (911), 45 states have return successors, (911), 901 states have call predecessors, (911), 911 states have call successors, (911) [2025-01-09 14:43:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7396 states to 7396 states and 12214 transitions. [2025-01-09 14:43:57,644 INFO L78 Accepts]: Start accepts. Automaton has 7396 states and 12214 transitions. Word has length 534 [2025-01-09 14:43:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:57,645 INFO L471 AbstractCegarLoop]: Abstraction has 7396 states and 12214 transitions. [2025-01-09 14:43:57,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:43:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7396 states and 12214 transitions. [2025-01-09 14:43:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:43:57,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:57,662 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:43:57,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1550403408, now seen corresponding path program 1 times [2025-01-09 14:43:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298080336] [2025-01-09 14:43:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:57,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:43:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:43:58,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:58,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:43:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298080336] [2025-01-09 14:43:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298080336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015117877] [2025-01-09 14:43:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:59,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:59,084 INFO L87 Difference]: Start difference. First operand 7396 states and 12214 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:00,701 INFO L93 Difference]: Finished difference Result 27352 states and 45056 transitions. [2025-01-09 14:44:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:00,785 INFO L225 Difference]: With dead ends: 27352 [2025-01-09 14:44:00,786 INFO L226 Difference]: Without dead ends: 20108 [2025-01-09 14:44:00,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:00,810 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 728 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:00,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2647 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:44:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20108 states. [2025-01-09 14:44:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20108 to 14494. [2025-01-09 14:44:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 12777 states have (on average 1.6049933474211473) internal successors, (20507), 12805 states have internal predecessors, (20507), 1631 states have call successors, (1631), 85 states have call predecessors, (1631), 85 states have return successors, (1631), 1603 states have call predecessors, (1631), 1631 states have call successors, (1631) [2025-01-09 14:44:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 23769 transitions. [2025-01-09 14:44:01,668 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 23769 transitions. Word has length 534 [2025-01-09 14:44:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 23769 transitions. [2025-01-09 14:44:01,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 23769 transitions. [2025-01-09 14:44:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:01,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:01,686 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:01,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:44:01,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:01,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1528410162, now seen corresponding path program 1 times [2025-01-09 14:44:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434036213] [2025-01-09 14:44:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:01,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:02,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:02,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:02,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434036213] [2025-01-09 14:44:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434036213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052558899] [2025-01-09 14:44:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:02,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:02,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:02,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:02,895 INFO L87 Difference]: Start difference. First operand 14494 states and 23769 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:03,843 INFO L93 Difference]: Finished difference Result 32419 states and 53204 transitions. [2025-01-09 14:44:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:03,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:03,910 INFO L225 Difference]: With dead ends: 32419 [2025-01-09 14:44:03,910 INFO L226 Difference]: Without dead ends: 18077 [2025-01-09 14:44:03,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:03,948 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 326 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1376 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:44:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18077 states. [2025-01-09 14:44:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18077 to 14533. [2025-01-09 14:44:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14533 states, 12816 states have (on average 1.6044787765293382) internal successors, (20563), 12844 states have internal predecessors, (20563), 1631 states have call successors, (1631), 85 states have call predecessors, (1631), 85 states have return successors, (1631), 1603 states have call predecessors, (1631), 1631 states have call successors, (1631) [2025-01-09 14:44:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 23825 transitions. [2025-01-09 14:44:05,066 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 23825 transitions. Word has length 534 [2025-01-09 14:44:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:05,067 INFO L471 AbstractCegarLoop]: Abstraction has 14533 states and 23825 transitions. [2025-01-09 14:44:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 23825 transitions. [2025-01-09 14:44:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:05,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:05,082 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:05,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:44:05,084 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1066322498, now seen corresponding path program 1 times [2025-01-09 14:44:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700177180] [2025-01-09 14:44:05,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:05,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:05,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:05,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700177180] [2025-01-09 14:44:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700177180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:05,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377586826] [2025-01-09 14:44:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:05,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:05,460 INFO L87 Difference]: Start difference. First operand 14533 states and 23825 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:06,635 INFO L93 Difference]: Finished difference Result 52379 states and 85861 transitions. [2025-01-09 14:44:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:06,772 INFO L225 Difference]: With dead ends: 52379 [2025-01-09 14:44:06,773 INFO L226 Difference]: Without dead ends: 38037 [2025-01-09 14:44:06,819 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 14:44:06,821 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 526 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:06,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1403 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38037 states. [2025-01-09 14:44:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38037 to 27733. [2025-01-09 14:44:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27733 states, 25271 states have (on average 1.6028649440069644) internal successors, (40506), 25335 states have internal predecessors, (40506), 2303 states have call successors, (2303), 158 states have call predecessors, (2303), 158 states have return successors, (2303), 2239 states have call predecessors, (2303), 2303 states have call successors, (2303) [2025-01-09 14:44:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27733 states to 27733 states and 45112 transitions. [2025-01-09 14:44:08,010 INFO L78 Accepts]: Start accepts. Automaton has 27733 states and 45112 transitions. Word has length 534 [2025-01-09 14:44:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:08,011 INFO L471 AbstractCegarLoop]: Abstraction has 27733 states and 45112 transitions. [2025-01-09 14:44:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 27733 states and 45112 transitions. [2025-01-09 14:44:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:08,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:08,031 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:08,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:44:08,032 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:08,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash 895252160, now seen corresponding path program 1 times [2025-01-09 14:44:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568653868] [2025-01-09 14:44:08,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:08,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:08,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568653868] [2025-01-09 14:44:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568653868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979790901] [2025-01-09 14:44:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:10,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:10,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:10,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:10,019 INFO L87 Difference]: Start difference. First operand 27733 states and 45112 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:12,776 INFO L93 Difference]: Finished difference Result 94625 states and 152807 transitions. [2025-01-09 14:44:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:13,015 INFO L225 Difference]: With dead ends: 94625 [2025-01-09 14:44:13,015 INFO L226 Difference]: Without dead ends: 66879 [2025-01-09 14:44:13,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:13,073 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1042 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:13,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1727 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:44:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66879 states. [2025-01-09 14:44:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66879 to 46973. [2025-01-09 14:44:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46973 states, 43134 states have (on average 1.5882830249918858) internal successors, (68509), 43246 states have internal predecessors, (68509), 3551 states have call successors, (3551), 287 states have call predecessors, (3551), 287 states have return successors, (3551), 3439 states have call predecessors, (3551), 3551 states have call successors, (3551) [2025-01-09 14:44:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46973 states to 46973 states and 75611 transitions. [2025-01-09 14:44:15,487 INFO L78 Accepts]: Start accepts. Automaton has 46973 states and 75611 transitions. Word has length 534 [2025-01-09 14:44:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:15,488 INFO L471 AbstractCegarLoop]: Abstraction has 46973 states and 75611 transitions. [2025-01-09 14:44:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 46973 states and 75611 transitions. [2025-01-09 14:44:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:15,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:15,512 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:15,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:44:15,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -111804866, now seen corresponding path program 1 times [2025-01-09 14:44:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580025680] [2025-01-09 14:44:15,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:15,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:15,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580025680] [2025-01-09 14:44:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580025680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713723862] [2025-01-09 14:44:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:15,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:15,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:16,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:16,000 INFO L87 Difference]: Start difference. First operand 46973 states and 75611 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:17,813 INFO L93 Difference]: Finished difference Result 118589 states and 190961 transitions. [2025-01-09 14:44:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:18,037 INFO L225 Difference]: With dead ends: 118589 [2025-01-09 14:44:18,038 INFO L226 Difference]: Without dead ends: 71839 [2025-01-09 14:44:18,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:18,118 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 463 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:18,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1211 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71839 states. [2025-01-09 14:44:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71839 to 52973. [2025-01-09 14:44:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52973 states, 49134 states have (on average 1.583485977123784) internal successors, (77803), 49246 states have internal predecessors, (77803), 3551 states have call successors, (3551), 287 states have call predecessors, (3551), 287 states have return successors, (3551), 3439 states have call predecessors, (3551), 3551 states have call successors, (3551) [2025-01-09 14:44:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52973 states to 52973 states and 84905 transitions. [2025-01-09 14:44:20,605 INFO L78 Accepts]: Start accepts. Automaton has 52973 states and 84905 transitions. Word has length 534 [2025-01-09 14:44:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:20,606 INFO L471 AbstractCegarLoop]: Abstraction has 52973 states and 84905 transitions. [2025-01-09 14:44:20,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 52973 states and 84905 transitions. [2025-01-09 14:44:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:20,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:20,632 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:44:20,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:20,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 321924220, now seen corresponding path program 1 times [2025-01-09 14:44:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398183557] [2025-01-09 14:44:20,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398183557] [2025-01-09 14:44:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398183557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:21,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171823062] [2025-01-09 14:44:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:21,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:21,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:21,872 INFO L87 Difference]: Start difference. First operand 52973 states and 84905 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:26,104 INFO L93 Difference]: Finished difference Result 181491 states and 291103 transitions. [2025-01-09 14:44:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:26,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 14:44:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:26,425 INFO L225 Difference]: With dead ends: 181491 [2025-01-09 14:44:26,425 INFO L226 Difference]: Without dead ends: 127749 [2025-01-09 14:44:26,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:26,502 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1328 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:26,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1207 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:44:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127749 states. [2025-01-09 14:44:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127749 to 94383. [2025-01-09 14:44:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94383 states, 86792 states have (on average 1.5801110701447139) internal successors, (137141), 87016 states have internal predecessors, (137141), 7023 states have call successors, (7023), 567 states have call predecessors, (7023), 567 states have return successors, (7023), 6799 states have call predecessors, (7023), 7023 states have call successors, (7023) [2025-01-09 14:44:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94383 states to 94383 states and 151187 transitions. [2025-01-09 14:44:30,069 INFO L78 Accepts]: Start accepts. Automaton has 94383 states and 151187 transitions. Word has length 534 [2025-01-09 14:44:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:30,070 INFO L471 AbstractCegarLoop]: Abstraction has 94383 states and 151187 transitions. [2025-01-09 14:44:30,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:44:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 94383 states and 151187 transitions. [2025-01-09 14:44:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 14:44:30,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:30,111 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:44:30,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:30,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1659311232, now seen corresponding path program 1 times [2025-01-09 14:44:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189718242] [2025-01-09 14:44:30,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:30,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 14:44:30,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 14:44:30,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:30,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:44:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189718242] [2025-01-09 14:44:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189718242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082249690] [2025-01-09 14:44:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:31,585 INFO L87 Difference]: Start difference. First operand 94383 states and 151187 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79)