./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.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-98.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 a20160bba21687cb57a07e35d1c7f0f20f9fc26125afd436a393ae4b40571e89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:52:42,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:52:42,323 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:52:42,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:52:42,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:52:42,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:52:42,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:52:42,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:52:42,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:52:42,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:52:42,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:52:42,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:52:42,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:52:42,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:52:42,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:52:42,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:52:42,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:42,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:42,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:42,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:52:42,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:52:42,352 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 -> a20160bba21687cb57a07e35d1c7f0f20f9fc26125afd436a393ae4b40571e89 [2025-01-09 14:52:42,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:52:42,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:52:42,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:52:42,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:52:42,607 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:52:42,608 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-98.i [2025-01-09 14:52:43,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/184b57ced/892bef749f7b4bce93968fc63e8c93ec/FLAG82e63148d [2025-01-09 14:52:44,211 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:52:44,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i [2025-01-09 14:52:44,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/184b57ced/892bef749f7b4bce93968fc63e8c93ec/FLAG82e63148d [2025-01-09 14:52:44,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/184b57ced/892bef749f7b4bce93968fc63e8c93ec [2025-01-09 14:52:44,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:52:44,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:52:44,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:44,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:52:44,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:52:44,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2501bf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44, skipping insertion in model container [2025-01-09 14:52:44,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:52:44,562 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-98.i[916,929] [2025-01-09 14:52:44,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:44,727 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:52:44,734 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-98.i[916,929] [2025-01-09 14:52:44,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:44,842 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:52:44,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44 WrapperNode [2025-01-09 14:52:44,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:44,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:44,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:52:44,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:52:44,850 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:52:44" (1/1) ... [2025-01-09 14:52:44,872 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:52:44" (1/1) ... [2025-01-09 14:52:44,935 INFO L138 Inliner]: procedures = 26, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 670 [2025-01-09 14:52:44,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:44,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:52:44,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:52:44,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:52:44,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,997 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:52:44,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:44,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:52:45,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:52:45,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:52:45,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:52:45,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (1/1) ... [2025-01-09 14:52:45,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:45,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:45,081 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:52:45,087 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:52:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:52:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:52:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:52:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:52:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:52:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:52:45,206 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:52:45,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:52:46,111 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-01-09 14:52:46,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:52:46,125 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:52:46,127 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:52:46,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:46 BoogieIcfgContainer [2025-01-09 14:52:46,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:52:46,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:52:46,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:52:46,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:52:46,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:44" (1/3) ... [2025-01-09 14:52:46,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176c47f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:46, skipping insertion in model container [2025-01-09 14:52:46,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:44" (2/3) ... [2025-01-09 14:52:46,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176c47f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:46, skipping insertion in model container [2025-01-09 14:52:46,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:46" (3/3) ... [2025-01-09 14:52:46,135 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-98.i [2025-01-09 14:52:46,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:52:46,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-98.i that has 2 procedures, 262 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:52:46,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:52:46,221 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;@29a85456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:52:46,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:52:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 201 states have (on average 1.537313432835821) internal successors, (309), 202 states have internal predecessors, (309), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 14:52:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:46,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:46,241 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:46,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:46,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash -345094066, now seen corresponding path program 1 times [2025-01-09 14:52:46,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:46,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473945623] [2025-01-09 14:52:46,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:46,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:46,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-01-09 14:52:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473945623] [2025-01-09 14:52:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473945623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548075433] [2025-01-09 14:52:46,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:46,731 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:52:46,733 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:52:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:46,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:46,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:46,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:46,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:52:46,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-01-09 14:52:47,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:52:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548075433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:52:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:52:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501528752] [2025-01-09 14:52:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:47,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:52:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:47,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:52:47,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:52:47,054 INFO L87 Difference]: Start difference. First operand has 262 states, 201 states have (on average 1.537313432835821) internal successors, (309), 202 states have internal predecessors, (309), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 14:52:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:47,093 INFO L93 Difference]: Finished difference Result 518 states and 903 transitions. [2025-01-09 14:52:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:52:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) Word has length 409 [2025-01-09 14:52:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:47,100 INFO L225 Difference]: With dead ends: 518 [2025-01-09 14:52:47,100 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 14:52:47,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 410 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:52:47,105 INFO L435 NwaCegarLoop]: 420 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, 420 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:52:47,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 14:52:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-01-09 14:52:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 199 states have (on average 1.5276381909547738) internal successors, (304), 199 states have internal predecessors, (304), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 14:52:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 420 transitions. [2025-01-09 14:52:47,161 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 420 transitions. Word has length 409 [2025-01-09 14:52:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:47,161 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 420 transitions. [2025-01-09 14:52:47,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 14:52:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 420 transitions. [2025-01-09 14:52:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:47,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:47,171 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,180 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:52:47,376 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:52:47,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:47,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash 149198546, now seen corresponding path program 1 times [2025-01-09 14:52:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877419682] [2025-01-09 14:52:47,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:47,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:47,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:47,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877419682] [2025-01-09 14:52:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877419682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:47,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:47,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321364101] [2025-01-09 14:52:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:47,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:47,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:47,790 INFO L87 Difference]: Start difference. First operand 259 states and 420 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:47,946 INFO L93 Difference]: Finished difference Result 738 states and 1197 transitions. [2025-01-09 14:52:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:47,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2025-01-09 14:52:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:47,953 INFO L225 Difference]: With dead ends: 738 [2025-01-09 14:52:47,953 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 14:52:47,954 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:52:47,955 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 382 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:47,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1106 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 14:52:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 329. [2025-01-09 14:52:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.550185873605948) internal successors, (417), 269 states have internal predecessors, (417), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 14:52:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 533 transitions. [2025-01-09 14:52:47,980 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 533 transitions. Word has length 409 [2025-01-09 14:52:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:47,981 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 533 transitions. [2025-01-09 14:52:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 533 transitions. [2025-01-09 14:52:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:47,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:47,984 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:52:47,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:47,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1270041708, now seen corresponding path program 1 times [2025-01-09 14:52:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824724103] [2025-01-09 14:52:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:48,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:48,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:48,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:48,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824724103] [2025-01-09 14:52:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824724103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347815423] [2025-01-09 14:52:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:48,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:48,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:48,344 INFO L87 Difference]: Start difference. First operand 329 states and 533 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:48,495 INFO L93 Difference]: Finished difference Result 977 states and 1585 transitions. [2025-01-09 14:52:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2025-01-09 14:52:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:48,504 INFO L225 Difference]: With dead ends: 977 [2025-01-09 14:52:48,505 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 14:52:48,506 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:52:48,507 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 401 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:48,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1195 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 14:52:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 641. [2025-01-09 14:52:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 522 states have (on average 1.5363984674329503) internal successors, (802), 522 states have internal predecessors, (802), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 14:52:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1034 transitions. [2025-01-09 14:52:48,591 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1034 transitions. Word has length 409 [2025-01-09 14:52:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 1034 transitions. [2025-01-09 14:52:48,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1034 transitions. [2025-01-09 14:52:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:48,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:48,596 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:52:48,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1263506604, now seen corresponding path program 1 times [2025-01-09 14:52:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121546699] [2025-01-09 14:52:48,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:48,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:48,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121546699] [2025-01-09 14:52:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121546699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:52:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570130091] [2025-01-09 14:52:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:52:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:50,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:52:50,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:52:50,425 INFO L87 Difference]: Start difference. First operand 641 states and 1034 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 14:52:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:51,777 INFO L93 Difference]: Finished difference Result 2065 states and 3315 transitions. [2025-01-09 14:52:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 409 [2025-01-09 14:52:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:51,787 INFO L225 Difference]: With dead ends: 2065 [2025-01-09 14:52:51,787 INFO L226 Difference]: Without dead ends: 1427 [2025-01-09 14:52:51,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:52:51,791 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1250 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:51,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1569 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:52:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-01-09 14:52:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1419. [2025-01-09 14:52:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1240 states have (on average 1.5564516129032258) internal successors, (1930), 1244 states have internal predecessors, (1930), 172 states have call successors, (172), 6 states have call predecessors, (172), 6 states have return successors, (172), 168 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 14:52:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2274 transitions. [2025-01-09 14:52:51,891 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2274 transitions. Word has length 409 [2025-01-09 14:52:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:51,892 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2274 transitions. [2025-01-09 14:52:51,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-01-09 14:52:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2274 transitions. [2025-01-09 14:52:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:51,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:51,895 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:52:51,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1186093526, now seen corresponding path program 1 times [2025-01-09 14:52:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134713319] [2025-01-09 14:52:51,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134713319] [2025-01-09 14:52:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134713319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14702283] [2025-01-09 14:52:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:52,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:52,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:52,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:52,390 INFO L87 Difference]: Start difference. First operand 1419 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:52,476 INFO L93 Difference]: Finished difference Result 2973 states and 4763 transitions. [2025-01-09 14:52:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2025-01-09 14:52:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:52,487 INFO L225 Difference]: With dead ends: 2973 [2025-01-09 14:52:52,488 INFO L226 Difference]: Without dead ends: 1557 [2025-01-09 14:52:52,491 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:52:52,492 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 405 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:52,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 819 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-01-09 14:52:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1519. [2025-01-09 14:52:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1280 states have (on average 1.5234375) internal successors, (1950), 1285 states have internal predecessors, (1950), 230 states have call successors, (230), 8 states have call predecessors, (230), 8 states have return successors, (230), 225 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 14:52:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2410 transitions. [2025-01-09 14:52:52,601 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2410 transitions. Word has length 409 [2025-01-09 14:52:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:52,602 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2410 transitions. [2025-01-09 14:52:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2410 transitions. [2025-01-09 14:52:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:52,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:52,607 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:52:52,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -842492584, now seen corresponding path program 1 times [2025-01-09 14:52:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389829540] [2025-01-09 14:52:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:52,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:52,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389829540] [2025-01-09 14:52:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389829540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:53,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:52:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629022149] [2025-01-09 14:52:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:53,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:52:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:53,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:52:53,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:52:53,615 INFO L87 Difference]: Start difference. First operand 1519 states and 2410 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-01-09 14:52:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:55,162 INFO L93 Difference]: Finished difference Result 6481 states and 10340 transitions. [2025-01-09 14:52:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:52:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 409 [2025-01-09 14:52:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:55,180 INFO L225 Difference]: With dead ends: 6481 [2025-01-09 14:52:55,180 INFO L226 Difference]: Without dead ends: 5065 [2025-01-09 14:52:55,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:52:55,185 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 3737 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3737 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:55,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3737 Valid, 2645 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:52:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-01-09 14:52:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 1919. [2025-01-09 14:52:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1678 states have (on average 1.5452920143027413) internal successors, (2593), 1682 states have internal predecessors, (2593), 230 states have call successors, (230), 10 states have call predecessors, (230), 10 states have return successors, (230), 226 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 14:52:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3053 transitions. [2025-01-09 14:52:55,334 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3053 transitions. Word has length 409 [2025-01-09 14:52:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:55,335 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 3053 transitions. [2025-01-09 14:52:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-01-09 14:52:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3053 transitions. [2025-01-09 14:52:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 14:52:55,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:55,344 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:52:55,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1660141034, now seen corresponding path program 1 times [2025-01-09 14:52:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252485219] [2025-01-09 14:52:55,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:55,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 14:52:55,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 14:52:55,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-01-09 14:52:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252485219] [2025-01-09 14:52:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252485219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912171233] [2025-01-09 14:52:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:58,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:58,383 INFO L87 Difference]: Start difference. First operand 1919 states and 3053 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:59,280 INFO L93 Difference]: Finished difference Result 3335 states and 5304 transitions. [2025-01-09 14:52:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2025-01-09 14:52:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:59,289 INFO L225 Difference]: With dead ends: 3335 [2025-01-09 14:52:59,289 INFO L226 Difference]: Without dead ends: 1919 [2025-01-09 14:52:59,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:59,293 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 463 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:59,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 711 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:52:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-01-09 14:52:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1919. [2025-01-09 14:52:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1678 states have (on average 1.5381406436233611) internal successors, (2581), 1682 states have internal predecessors, (2581), 230 states have call successors, (230), 10 states have call predecessors, (230), 10 states have return successors, (230), 226 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 14:52:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3041 transitions. [2025-01-09 14:52:59,373 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3041 transitions. Word has length 409 [2025-01-09 14:52:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:59,374 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 3041 transitions. [2025-01-09 14:52:59,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-01-09 14:52:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3041 transitions. [2025-01-09 14:52:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 14:52:59,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:59,378 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:59,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:52:59,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash -103431311, now seen corresponding path program 1 times [2025-01-09 14:52:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885632906] [2025-01-09 14:52:59,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:59,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 14:53:00,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 14:53:00,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:00,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat