./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.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 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:08:24,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:08:24,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:08:24,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:08:24,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:08:25,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:08:25,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:08:25,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:08:25,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:08:25,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:08:25,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:08:25,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:08:25,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:08:25,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:08:25,004 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:08:25,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:08:25,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:08:25,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:08:25,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:08:25,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:08:25,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:08:25,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:08:25,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:25,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:25,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:25,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:25,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:08:25,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:08:25,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:08:25,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:08:25,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:08:25,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:08:25,009 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 -> 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a [2025-01-09 10:08:25,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:08:25,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:08:25,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:08:25,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:08:25,328 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:08:25,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-01-09 10:08:26,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a084b657b/7e4ce39e1dba45ac956590178c7a7a95/FLAG71f7f4643 [2025-01-09 10:08:27,081 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:08:27,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-01-09 10:08:27,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a084b657b/7e4ce39e1dba45ac956590178c7a7a95/FLAG71f7f4643 [2025-01-09 10:08:27,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a084b657b/7e4ce39e1dba45ac956590178c7a7a95 [2025-01-09 10:08:27,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:08:27,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:08:27,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:27,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:08:27,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:08:27,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6146f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27, skipping insertion in model container [2025-01-09 10:08:27,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:08:27,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i[915,928] [2025-01-09 10:08:27,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:27,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:08:27,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i[915,928] [2025-01-09 10:08:27,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:27,646 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:08:27,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27 WrapperNode [2025-01-09 10:08:27,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:27,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:27,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:08:27,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:08:27,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,764 INFO L138 Inliner]: procedures = 26, calls = 147, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 937 [2025-01-09 10:08:27,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:27,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:08:27,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:08:27,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:08:27,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:08:27,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:08:27,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:08:27,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:08:27,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:08:27,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (1/1) ... [2025-01-09 10:08:27,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:27,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:08:27,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:08:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:08:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:08:28,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:08:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:08:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:08:28,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:08:28,175 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:08:28,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:08:29,634 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 10:08:29,635 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:08:29,659 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:08:29,663 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:08:29,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:29 BoogieIcfgContainer [2025-01-09 10:08:29,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:08:29,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:08:29,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:08:29,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:08:29,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:08:27" (1/3) ... [2025-01-09 10:08:29,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb4cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:29, skipping insertion in model container [2025-01-09 10:08:29,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:27" (2/3) ... [2025-01-09 10:08:29,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb4cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:29, skipping insertion in model container [2025-01-09 10:08:29,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:29" (3/3) ... [2025-01-09 10:08:29,676 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-01-09 10:08:29,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:08:29,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i that has 2 procedures, 395 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:08:29,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:08:29,796 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;@6f8b5d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:08:29,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:08:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 10:08:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-01-09 10:08:29,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:29,851 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:29,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:29,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash -927261197, now seen corresponding path program 1 times [2025-01-09 10:08:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491558310] [2025-01-09 10:08:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:30,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-01-09 10:08:30,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-01-09 10:08:30,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:30,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-01-09 10:08:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491558310] [2025-01-09 10:08:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491558310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310633366] [2025-01-09 10:08:30,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:30,793 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 10:08:30,795 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 10:08:31,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-01-09 10:08:31,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-01-09 10:08:31,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:31,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1852 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:08:31,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-01-09 10:08:31,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:08:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310633366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:08:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:08:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765091976] [2025-01-09 10:08:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:31,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:08:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:31,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:08:31,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:31,524 INFO L87 Difference]: Start difference. First operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-01-09 10:08:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:31,631 INFO L93 Difference]: Finished difference Result 784 states and 1485 transitions. [2025-01-09 10:08:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:08:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) Word has length 832 [2025-01-09 10:08:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:31,652 INFO L225 Difference]: With dead ends: 784 [2025-01-09 10:08:31,653 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 10:08:31,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 833 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 10:08:31,666 INFO L435 NwaCegarLoop]: 669 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, 669 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 10:08:31,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 10:08:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-01-09 10:08:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 256 states have (on average 1.56640625) internal successors, (401), 256 states have internal predecessors, (401), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 10:08:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 669 transitions. [2025-01-09 10:08:31,808 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 669 transitions. Word has length 832 [2025-01-09 10:08:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:31,811 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 669 transitions. [2025-01-09 10:08:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-01-09 10:08:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 669 transitions. [2025-01-09 10:08:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-01-09 10:08:31,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:31,843 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:31,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:08:32,047 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 10:08:32,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:32,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1331148384, now seen corresponding path program 1 times [2025-01-09 10:08:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:32,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036117315] [2025-01-09 10:08:32,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-01-09 10:08:32,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-01-09 10:08:32,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036117315] [2025-01-09 10:08:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036117315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742107982] [2025-01-09 10:08:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:33,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:33,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:33,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:33,155 INFO L87 Difference]: Start difference. First operand 392 states and 669 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:33,269 INFO L93 Difference]: Finished difference Result 1001 states and 1721 transitions. [2025-01-09 10:08:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-01-09 10:08:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:33,290 INFO L225 Difference]: With dead ends: 1001 [2025-01-09 10:08:33,291 INFO L226 Difference]: Without dead ends: 612 [2025-01-09 10:08:33,293 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 10:08:33,294 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 333 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:33,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1377 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-09 10:08:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2025-01-09 10:08:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 443 states have (on average 1.6320541760722347) internal successors, (723), 444 states have internal predecessors, (723), 163 states have call successors, (163), 2 states have call predecessors, (163), 2 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-01-09 10:08:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1049 transitions. [2025-01-09 10:08:33,413 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1049 transitions. Word has length 833 [2025-01-09 10:08:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 1049 transitions. [2025-01-09 10:08:33,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1049 transitions. [2025-01-09 10:08:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-01-09 10:08:33,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:33,433 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:33,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:08:33,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:33,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1084687966, now seen corresponding path program 1 times [2025-01-09 10:08:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750490212] [2025-01-09 10:08:33,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:33,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-01-09 10:08:33,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-01-09 10:08:33,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:33,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750490212] [2025-01-09 10:08:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750490212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:33,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:33,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:33,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218517340] [2025-01-09 10:08:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:33,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:33,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:33,955 INFO L87 Difference]: Start difference. First operand 609 states and 1049 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:34,090 INFO L93 Difference]: Finished difference Result 1815 states and 3129 transitions. [2025-01-09 10:08:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-01-09 10:08:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:34,114 INFO L225 Difference]: With dead ends: 1815 [2025-01-09 10:08:34,114 INFO L226 Difference]: Without dead ends: 1209 [2025-01-09 10:08:34,120 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 10:08:34,121 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 607 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:34,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1724 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-01-09 10:08:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1205. [2025-01-09 10:08:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 874 states have (on average 1.620137299771167) internal successors, (1416), 876 states have internal predecessors, (1416), 326 states have call successors, (326), 4 states have call predecessors, (326), 4 states have return successors, (326), 324 states have call predecessors, (326), 326 states have call successors, (326) [2025-01-09 10:08:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2068 transitions. [2025-01-09 10:08:34,440 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2068 transitions. Word has length 833 [2025-01-09 10:08:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:34,442 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 2068 transitions. [2025-01-09 10:08:34,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2068 transitions. [2025-01-09 10:08:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-01-09 10:08:34,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:34,456 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:08:34,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:34,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1146727580, now seen corresponding path program 1 times [2025-01-09 10:08:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987905862] [2025-01-09 10:08:34,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:34,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-01-09 10:08:34,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-01-09 10:08:34,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:34,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987905862] [2025-01-09 10:08:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987905862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759074856] [2025-01-09 10:08:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:34,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:34,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:34,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:34,885 INFO L87 Difference]: Start difference. First operand 1205 states and 2068 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:35,035 INFO L93 Difference]: Finished difference Result 3609 states and 6198 transitions. [2025-01-09 10:08:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:35,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-01-09 10:08:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:35,088 INFO L225 Difference]: With dead ends: 3609 [2025-01-09 10:08:35,089 INFO L226 Difference]: Without dead ends: 2407 [2025-01-09 10:08:35,094 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 10:08:35,096 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 659 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2025-01-09 10:08:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2405. [2025-01-09 10:08:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 1744 states have (on average 1.614678899082569) internal successors, (2816), 1748 states have internal predecessors, (2816), 652 states have call successors, (652), 8 states have call predecessors, (652), 8 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-01-09 10:08:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4120 transitions. [2025-01-09 10:08:35,497 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4120 transitions. Word has length 833 [2025-01-09 10:08:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:35,504 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4120 transitions. [2025-01-09 10:08:35,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4120 transitions. [2025-01-09 10:08:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-01-09 10:08:35,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:35,515 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:35,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:08:35,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:35,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1154095010, now seen corresponding path program 1 times [2025-01-09 10:08:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155829579] [2025-01-09 10:08:35,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:35,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-01-09 10:08:35,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-01-09 10:08:35,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:35,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155829579] [2025-01-09 10:08:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155829579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:36,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624618054] [2025-01-09 10:08:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:36,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:36,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:36,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:36,111 INFO L87 Difference]: Start difference. First operand 2405 states and 4120 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:36,360 INFO L93 Difference]: Finished difference Result 4813 states and 8246 transitions. [2025-01-09 10:08:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:36,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-01-09 10:08:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:36,383 INFO L225 Difference]: With dead ends: 4813 [2025-01-09 10:08:36,383 INFO L226 Difference]: Without dead ends: 2411 [2025-01-09 10:08:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 10:08:36,392 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 620 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:36,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2785 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-01-09 10:08:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2405. [2025-01-09 10:08:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 1744 states have (on average 1.6123853211009174) internal successors, (2812), 1748 states have internal predecessors, (2812), 652 states have call successors, (652), 8 states have call predecessors, (652), 8 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-01-09 10:08:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 4116 transitions. [2025-01-09 10:08:36,670 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 4116 transitions. Word has length 833 [2025-01-09 10:08:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:36,672 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 4116 transitions. [2025-01-09 10:08:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 4116 transitions. [2025-01-09 10:08:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-01-09 10:08:36,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:36,681 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:36,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:08:36,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:36,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:36,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1128520362, now seen corresponding path program 1 times [2025-01-09 10:08:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:36,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162333129] [2025-01-09 10:08:36,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:36,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-01-09 10:08:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-01-09 10:08:36,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:36,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162333129] [2025-01-09 10:08:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162333129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331501968] [2025-01-09 10:08:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:37,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:37,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:37,406 INFO L87 Difference]: Start difference. First operand 2405 states and 4116 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-01-09 10:08:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:38,463 INFO L93 Difference]: Finished difference Result 8787 states and 15051 transitions. [2025-01-09 10:08:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) Word has length 835 [2025-01-09 10:08:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:38,518 INFO L225 Difference]: With dead ends: 8787 [2025-01-09 10:08:38,518 INFO L226 Difference]: Without dead ends: 6385 [2025-01-09 10:08:38,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:08:38,535 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 1080 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:38,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2666 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:08:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2025-01-09 10:08:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 6377. [2025-01-09 10:08:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6377 states, 4792 states have (on average 1.6268781302170283) internal successors, (7796), 4808 states have internal predecessors, (7796), 1560 states have call successors, (1560), 24 states have call predecessors, (1560), 24 states have return successors, (1560), 1544 states have call predecessors, (1560), 1560 states have call successors, (1560) [2025-01-09 10:08:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6377 states to 6377 states and 10916 transitions. [2025-01-09 10:08:39,260 INFO L78 Accepts]: Start accepts. Automaton has 6377 states and 10916 transitions. Word has length 835 [2025-01-09 10:08:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 6377 states and 10916 transitions. [2025-01-09 10:08:39,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-01-09 10:08:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6377 states and 10916 transitions. [2025-01-09 10:08:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-01-09 10:08:39,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:39,275 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:39,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:08:39,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:39,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1600598684, now seen corresponding path program 1 times [2025-01-09 10:08:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46422436] [2025-01-09 10:08:39,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:39,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-01-09 10:08:39,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-01-09 10:08:39,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:39,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46422436] [2025-01-09 10:08:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46422436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074070017] [2025-01-09 10:08:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:40,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:40,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:40,541 INFO L87 Difference]: Start difference. First operand 6377 states and 10916 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:41,669 INFO L93 Difference]: Finished difference Result 19149 states and 32790 transitions. [2025-01-09 10:08:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:41,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 835 [2025-01-09 10:08:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:41,782 INFO L225 Difference]: With dead ends: 19149 [2025-01-09 10:08:41,783 INFO L226 Difference]: Without dead ends: 12775 [2025-01-09 10:08:41,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:08:41,806 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 437 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:41,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1699 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:08:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12775 states. [2025-01-09 10:08:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12775 to 12749. [2025-01-09 10:08:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12749 states, 9580 states have (on average 1.6221294363256784) internal successors, (15540), 9612 states have internal predecessors, (15540), 3120 states have call successors, (3120), 48 states have call predecessors, (3120), 48 states have return successors, (3120), 3088 states have call predecessors, (3120), 3120 states have call successors, (3120) [2025-01-09 10:08:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12749 states to 12749 states and 21780 transitions. [2025-01-09 10:08:43,331 INFO L78 Accepts]: Start accepts. Automaton has 12749 states and 21780 transitions. Word has length 835 [2025-01-09 10:08:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:43,332 INFO L471 AbstractCegarLoop]: Abstraction has 12749 states and 21780 transitions. [2025-01-09 10:08:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-01-09 10:08:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12749 states and 21780 transitions. [2025-01-09 10:08:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-01-09 10:08:43,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:43,350 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:43,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:08:43,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:43,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1006648691, now seen corresponding path program 1 times [2025-01-09 10:08:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:43,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360287699] [2025-01-09 10:08:43,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:43,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:43,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-01-09 10:08:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-01-09 10:08:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:43,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-01-09 10:08:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360287699] [2025-01-09 10:08:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360287699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:46,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:08:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594401346] [2025-01-09 10:08:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:08:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:46,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:08:46,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:08:46,172 INFO L87 Difference]: Start difference. First operand 12749 states and 21780 transitions. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-01-09 10:09:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:01,046 INFO L93 Difference]: Finished difference Result 116337 states and 198046 transitions. [2025-01-09 10:09:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:09:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) Word has length 836 [2025-01-09 10:09:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:01,555 INFO L225 Difference]: With dead ends: 116337 [2025-01-09 10:09:01,556 INFO L226 Difference]: Without dead ends: 103591 [2025-01-09 10:09:01,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:09:01,645 INFO L435 NwaCegarLoop]: 2347 mSDtfsCounter, 4959 mSDsluCounter, 5769 mSDsCounter, 0 mSdLazyCounter, 6002 mSolverCounterSat, 1855 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4959 SdHoareTripleChecker+Valid, 8116 SdHoareTripleChecker+Invalid, 7857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1855 IncrementalHoareTripleChecker+Valid, 6002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:01,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4959 Valid, 8116 Invalid, 7857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1855 Valid, 6002 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-01-09 10:09:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103591 states. [2025-01-09 10:09:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103591 to 80501. [2025-01-09 10:09:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80501 states, 61924 states have (on average 1.6237323170337834) internal successors, (100548), 62196 states have internal predecessors, (100548), 18240 states have call successors, (18240), 336 states have call predecessors, (18240), 336 states have return successors, (18240), 17968 states have call predecessors, (18240), 18240 states have call successors, (18240) [2025-01-09 10:09:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80501 states to 80501 states and 137028 transitions. [2025-01-09 10:09:11,231 INFO L78 Accepts]: Start accepts. Automaton has 80501 states and 137028 transitions. Word has length 836 [2025-01-09 10:09:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 80501 states and 137028 transitions. [2025-01-09 10:09:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-01-09 10:09:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 80501 states and 137028 transitions. [2025-01-09 10:09:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-01-09 10:09:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:11,274 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:11,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:09:11,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1901533195, now seen corresponding path program 1 times [2025-01-09 10:09:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017604990] [2025-01-09 10:09:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-01-09 10:09:11,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-01-09 10:09:11,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:11,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 366 proven. 33 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-01-09 10:09:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017604990] [2025-01-09 10:09:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017604990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888953093] [2025-01-09 10:09:12,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:12,591 INFO L229 MonitoredProcess]: Starting monitored process 3 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 10:09:12,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:09:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-01-09 10:09:13,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-01-09 10:09:13,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:13,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:13,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1855 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:09:13,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 5745 proven. 33 refuted. 0 times theorem prover too weak. 29866 trivial. 0 not checked. [2025-01-09 10:09:13,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 366 proven. 33 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-01-09 10:09:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888953093] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:15,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:15,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:09:15,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466169958] [2025-01-09 10:09:15,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:15,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:09:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:15,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:09:15,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:15,148 INFO L87 Difference]: Start difference. First operand 80501 states and 137028 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 2 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 2 states have call predecessors, (146), 2 states have call successors, (146) [2025-01-09 10:09:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:20,490 INFO L93 Difference]: Finished difference Result 162055 states and 275045 transitions. [2025-01-09 10:09:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:09:20,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 2 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 2 states have call predecessors, (146), 2 states have call successors, (146) Word has length 836 [2025-01-09 10:09:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:20,970 INFO L225 Difference]: With dead ends: 162055 [2025-01-09 10:09:20,971 INFO L226 Difference]: Without dead ends: 81557 [2025-01-09 10:09:21,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1679 GetRequests, 1669 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:09:21,142 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 751 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:21,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1324 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:09:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81557 states. [2025-01-09 10:09:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81557 to 80757. [2025-01-09 10:09:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80757 states, 62116 states have (on average 1.6163951316890979) internal successors, (100404), 62388 states have internal predecessors, (100404), 18240 states have call successors, (18240), 400 states have call predecessors, (18240), 400 states have return successors, (18240), 17968 states have call predecessors, (18240), 18240 states have call successors, (18240) [2025-01-09 10:09:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80757 states to 80757 states and 136884 transitions. [2025-01-09 10:09:28,159 INFO L78 Accepts]: Start accepts. Automaton has 80757 states and 136884 transitions. Word has length 836 [2025-01-09 10:09:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 80757 states and 136884 transitions. [2025-01-09 10:09:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 2 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (146), 2 states have call predecessors, (146), 2 states have call successors, (146) [2025-01-09 10:09:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 80757 states and 136884 transitions. [2025-01-09 10:09:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-01-09 10:09:28,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:28,201 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:28,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 10:09:28,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:28,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:28,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1113570423, now seen corresponding path program 1 times [2025-01-09 10:09:28,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:28,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909317752] [2025-01-09 10:09:28,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:28,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-01-09 10:09:29,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-01-09 10:09:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 354 proven. 45 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-01-09 10:09:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909317752] [2025-01-09 10:09:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909317752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11974447] [2025-01-09 10:09:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:30,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:30,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:30,592 INFO L229 MonitoredProcess]: Starting monitored process 4 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 10:09:30,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:09:31,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes.