./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.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-100_file-11.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:14:38,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:14:38,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:14:38,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:14:38,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:14:38,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:14:38,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:14:38,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:14:38,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:14:38,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:14:38,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:14:38,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:14:38,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:14:38,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:14:38,860 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:14:38,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:14:38,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:14:38,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:14:38,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:14:38,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:38,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:38,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:14:38,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:14:38,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:14:38,863 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2025-01-09 09:14:39,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:14:39,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:14:39,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:14:39,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:14:39,128 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:14:39,129 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-100_file-11.i [2025-01-09 09:14:40,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b56dbbaab/5cacbe2b936f4d27a9066e6125579f1a/FLAG6f7793e5d [2025-01-09 09:14:40,571 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:14:40,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2025-01-09 09:14:40,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b56dbbaab/5cacbe2b936f4d27a9066e6125579f1a/FLAG6f7793e5d [2025-01-09 09:14:40,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b56dbbaab/5cacbe2b936f4d27a9066e6125579f1a [2025-01-09 09:14:40,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:14:40,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:14:40,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:40,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:14:40,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:14:40,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40, skipping insertion in model container [2025-01-09 09:14:40,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:14:40,759 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-100_file-11.i[916,929] [2025-01-09 09:14:40,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:40,847 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:14:40,862 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-100_file-11.i[916,929] [2025-01-09 09:14:40,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:40,934 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:14:40,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40 WrapperNode [2025-01-09 09:14:40,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:40,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:40,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:14:40,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:14:40,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,987 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-01-09 09:14:40,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:40,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:14:40,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:14:40,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:14:40,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:40,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,019 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 09:14:41,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:14:41,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:14:41,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:14:41,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:14:41,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (1/1) ... [2025-01-09 09:14:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:41,082 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 09:14:41,085 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 09:14:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:14:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:14:41,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:14:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:14:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:14:41,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:14:41,187 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:14:41,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:14:41,622 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:14:41,623 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:14:41,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:14:41,633 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:14:41,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:41 BoogieIcfgContainer [2025-01-09 09:14:41,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:14:41,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:14:41,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:14:41,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:14:41,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:14:40" (1/3) ... [2025-01-09 09:14:41,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7015c1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:41, skipping insertion in model container [2025-01-09 09:14:41,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:40" (2/3) ... [2025-01-09 09:14:41,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7015c1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:41, skipping insertion in model container [2025-01-09 09:14:41,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:41" (3/3) ... [2025-01-09 09:14:41,645 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2025-01-09 09:14:41,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:14:41,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 132 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:14:41,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:14:41,715 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;@7b7de5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:14:41,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:14:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 09:14:41,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:41,734 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:41,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1104196521, now seen corresponding path program 1 times [2025-01-09 09:14:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727723882] [2025-01-09 09:14:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:41,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 09:14:41,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 09:14:41,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:41,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 09:14:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727723882] [2025-01-09 09:14:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727723882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:14:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745315895] [2025-01-09 09:14:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:42,089 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 09:14:42,091 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 09:14:42,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 09:14:42,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 09:14:42,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:42,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:42,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:14:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 09:14:42,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745315895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:14:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:14:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083476093] [2025-01-09 09:14:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:14:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:14:42,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:14:42,362 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 09:14:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:42,387 INFO L93 Difference]: Finished difference Result 258 states and 466 transitions. [2025-01-09 09:14:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:14:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 250 [2025-01-09 09:14:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:42,393 INFO L225 Difference]: With dead ends: 258 [2025-01-09 09:14:42,393 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 09:14:42,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 251 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 09:14:42,398 INFO L435 NwaCegarLoop]: 210 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, 210 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 09:14:42,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 09:14:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 09:14:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.5) internal successors, (132), 88 states have internal predecessors, (132), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 210 transitions. [2025-01-09 09:14:42,433 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 210 transitions. Word has length 250 [2025-01-09 09:14:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:42,433 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 210 transitions. [2025-01-09 09:14:42,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 09:14:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 210 transitions. [2025-01-09 09:14:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 09:14:42,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:42,437 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:42,445 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 09:14:42,637 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 09:14:42,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1051025707, now seen corresponding path program 1 times [2025-01-09 09:14:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391651809] [2025-01-09 09:14:42,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 09:14:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 09:14:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:42,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:42,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391651809] [2025-01-09 09:14:42,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391651809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:42,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:42,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196830427] [2025-01-09 09:14:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:42,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:42,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:42,942 INFO L87 Difference]: Start difference. First operand 129 states and 210 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:42,984 INFO L93 Difference]: Finished difference Result 322 states and 522 transitions. [2025-01-09 09:14:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2025-01-09 09:14:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:42,987 INFO L225 Difference]: With dead ends: 322 [2025-01-09 09:14:42,987 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 09:14:42,988 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 09:14:42,989 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 200 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:42,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 408 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 09:14:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2025-01-09 09:14:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions. [2025-01-09 09:14:43,003 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250 [2025-01-09 09:14:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:43,006 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 208 transitions. [2025-01-09 09:14:43,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions. [2025-01-09 09:14:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 09:14:43,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:43,012 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:14:43,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2024175564, now seen corresponding path program 1 times [2025-01-09 09:14:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:43,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495582923] [2025-01-09 09:14:43,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:43,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 09:14:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 09:14:43,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:43,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495582923] [2025-01-09 09:14:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495582923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:14:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937735912] [2025-01-09 09:14:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:14:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:43,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:14:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:43,421 INFO L87 Difference]: Start difference. First operand 129 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:43,634 INFO L93 Difference]: Finished difference Result 351 states and 567 transitions. [2025-01-09 09:14:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:14:43,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 251 [2025-01-09 09:14:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:43,639 INFO L225 Difference]: With dead ends: 351 [2025-01-09 09:14:43,639 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 09:14:43,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:43,640 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 288 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:43,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 541 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:14:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 09:14:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2025-01-09 09:14:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions. [2025-01-09 09:14:43,664 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251 [2025-01-09 09:14:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 238 transitions. [2025-01-09 09:14:43,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions. [2025-01-09 09:14:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 09:14:43,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:43,671 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:43,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:14:43,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -906072604, now seen corresponding path program 1 times [2025-01-09 09:14:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286375026] [2025-01-09 09:14:43,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:43,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 09:14:43,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 09:14:43,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:43,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286375026] [2025-01-09 09:14:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286375026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:43,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:43,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660467165] [2025-01-09 09:14:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:43,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:43,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:43,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:43,828 INFO L87 Difference]: Start difference. First operand 149 states and 238 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:43,851 INFO L93 Difference]: Finished difference Result 296 states and 475 transitions. [2025-01-09 09:14:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2025-01-09 09:14:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:43,853 INFO L225 Difference]: With dead ends: 296 [2025-01-09 09:14:43,853 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 09:14:43,853 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 09:14:43,854 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:43,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 09:14:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 09:14:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions. [2025-01-09 09:14:43,869 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252 [2025-01-09 09:14:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:43,870 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 239 transitions. [2025-01-09 09:14:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2025-01-09 09:14:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 09:14:43,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:43,873 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:43,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:14:43,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:43,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1394749986, now seen corresponding path program 1 times [2025-01-09 09:14:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049319804] [2025-01-09 09:14:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:43,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 09:14:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 09:14:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049319804] [2025-01-09 09:14:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049319804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:43,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397714754] [2025-01-09 09:14:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:43,996 INFO L87 Difference]: Start difference. First operand 150 states and 239 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:44,054 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2025-01-09 09:14:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2025-01-09 09:14:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:44,057 INFO L225 Difference]: With dead ends: 408 [2025-01-09 09:14:44,057 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 09:14:44,058 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 09:14:44,058 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 137 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:44,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 09:14:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-01-09 09:14:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 192 states have (on average 1.5) internal successors, (288), 193 states have internal predecessors, (288), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 09:14:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions. [2025-01-09 09:14:44,083 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252 [2025-01-09 09:14:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:44,084 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 410 transitions. [2025-01-09 09:14:44,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions. [2025-01-09 09:14:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 09:14:44,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:44,086 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:44,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:14:44,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:44,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 885276896, now seen corresponding path program 1 times [2025-01-09 09:14:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780873682] [2025-01-09 09:14:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:44,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 09:14:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 09:14:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780873682] [2025-01-09 09:14:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780873682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:14:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840256985] [2025-01-09 09:14:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:14:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:44,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:14:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:14:44,434 INFO L87 Difference]: Start difference. First operand 258 states and 410 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:45,304 INFO L93 Difference]: Finished difference Result 963 states and 1520 transitions. [2025-01-09 09:14:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:14:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2025-01-09 09:14:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:45,313 INFO L225 Difference]: With dead ends: 963 [2025-01-09 09:14:45,314 INFO L226 Difference]: Without dead ends: 708 [2025-01-09 09:14:45,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:14:45,315 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 689 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:45,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1090 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:14:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-01-09 09:14:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 482. [2025-01-09 09:14:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 351 states have (on average 1.4729344729344729) internal successors, (517), 353 states have internal predecessors, (517), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 09:14:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 761 transitions. [2025-01-09 09:14:45,372 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 761 transitions. Word has length 252 [2025-01-09 09:14:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:45,372 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 761 transitions. [2025-01-09 09:14:45,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 761 transitions. [2025-01-09 09:14:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 09:14:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:45,374 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:14:45,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 67628446, now seen corresponding path program 1 times [2025-01-09 09:14:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932691657] [2025-01-09 09:14:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:45,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 09:14:45,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 09:14:45,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:45,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932691657] [2025-01-09 09:14:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932691657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:45,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:14:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786814800] [2025-01-09 09:14:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:45,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:14:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:45,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:14:45,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:45,873 INFO L87 Difference]: Start difference. First operand 482 states and 761 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:45,947 INFO L93 Difference]: Finished difference Result 1003 states and 1576 transitions. [2025-01-09 09:14:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:14:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2025-01-09 09:14:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:45,951 INFO L225 Difference]: With dead ends: 1003 [2025-01-09 09:14:45,951 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 09:14:45,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:45,954 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 32 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:45,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 773 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 09:14:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 498. [2025-01-09 09:14:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 367 states have (on average 1.4741144414168936) internal successors, (541), 369 states have internal predecessors, (541), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 09:14:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 785 transitions. [2025-01-09 09:14:46,006 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 785 transitions. Word has length 252 [2025-01-09 09:14:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 785 transitions. [2025-01-09 09:14:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 785 transitions. [2025-01-09 09:14:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 09:14:46,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:46,013 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:46,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:14:46,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 69475488, now seen corresponding path program 1 times [2025-01-09 09:14:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139148835] [2025-01-09 09:14:46,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:46,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 09:14:46,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 09:14:46,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:46,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139148835] [2025-01-09 09:14:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139148835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:46,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:14:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960598017] [2025-01-09 09:14:46,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:14:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:46,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:14:46,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:46,374 INFO L87 Difference]: Start difference. First operand 498 states and 785 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:46,597 INFO L93 Difference]: Finished difference Result 1306 states and 2069 transitions. [2025-01-09 09:14:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:14:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2025-01-09 09:14:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:46,602 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 09:14:46,603 INFO L226 Difference]: Without dead ends: 811 [2025-01-09 09:14:46,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:14:46,604 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 192 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:46,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 724 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:14:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-01-09 09:14:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 729. [2025-01-09 09:14:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 557 states have (on average 1.5008976660682227) internal successors, (836), 559 states have internal predecessors, (836), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 09:14:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1158 transitions. [2025-01-09 09:14:46,657 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1158 transitions. Word has length 252 [2025-01-09 09:14:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:46,658 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1158 transitions. [2025-01-09 09:14:46,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1158 transitions. [2025-01-09 09:14:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 09:14:46,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:46,660 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:46,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:14:46,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash -730579055, now seen corresponding path program 1 times [2025-01-09 09:14:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672499568] [2025-01-09 09:14:46,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:46,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 09:14:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 09:14:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672499568] [2025-01-09 09:14:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672499568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:14:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611630921] [2025-01-09 09:14:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:47,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:14:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:47,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:14:47,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:14:47,771 INFO L87 Difference]: Start difference. First operand 729 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 09:14:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:48,964 INFO L93 Difference]: Finished difference Result 2481 states and 3935 transitions. [2025-01-09 09:14:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:14:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 253 [2025-01-09 09:14:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:48,974 INFO L225 Difference]: With dead ends: 2481 [2025-01-09 09:14:48,974 INFO L226 Difference]: Without dead ends: 1944 [2025-01-09 09:14:48,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:14:48,977 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1015 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:48,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 774 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:14:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-01-09 09:14:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 765. [2025-01-09 09:14:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 593 states have (on average 1.4907251264755481) internal successors, (884), 595 states have internal predecessors, (884), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 09:14:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1206 transitions. [2025-01-09 09:14:49,104 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1206 transitions. Word has length 253 [2025-01-09 09:14:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:49,104 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1206 transitions. [2025-01-09 09:14:49,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 09:14:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1206 transitions. [2025-01-09 09:14:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 09:14:49,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:49,106 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:14:49,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -590030445, now seen corresponding path program 1 times [2025-01-09 09:14:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073766227] [2025-01-09 09:14:49,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:49,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 09:14:49,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 09:14:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073766227] [2025-01-09 09:14:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073766227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:14:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974674269] [2025-01-09 09:14:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:49,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:14:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:14:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:14:49,209 INFO L87 Difference]: Start difference. First operand 765 states and 1206 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:49,406 INFO L93 Difference]: Finished difference Result 1484 states and 2339 transitions. [2025-01-09 09:14:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:14:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253 [2025-01-09 09:14:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:49,412 INFO L225 Difference]: With dead ends: 1484 [2025-01-09 09:14:49,412 INFO L226 Difference]: Without dead ends: 905 [2025-01-09 09:14:49,414 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 09:14:49,414 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 140 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:49,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 753 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:14:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-01-09 09:14:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 751. [2025-01-09 09:14:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 579 states have (on average 1.4818652849740932) internal successors, (858), 581 states have internal predecessors, (858), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 09:14:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1180 transitions. [2025-01-09 09:14:49,533 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1180 transitions. Word has length 253 [2025-01-09 09:14:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1180 transitions. [2025-01-09 09:14:49,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1180 transitions. [2025-01-09 09:14:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 09:14:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:49,537 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:14:49,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:49,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1929947029, now seen corresponding path program 1 times [2025-01-09 09:14:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640119384] [2025-01-09 09:14:49,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:49,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 09:14:49,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 09:14:49,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640119384] [2025-01-09 09:14:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640119384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:49,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:49,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:14:49,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251195418] [2025-01-09 09:14:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:14:49,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:49,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:14:49,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:14:49,717 INFO L87 Difference]: Start difference. First operand 751 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:50,002 INFO L93 Difference]: Finished difference Result 1322 states and 2097 transitions. [2025-01-09 09:14:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:14:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253 [2025-01-09 09:14:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:50,009 INFO L225 Difference]: With dead ends: 1322 [2025-01-09 09:14:50,009 INFO L226 Difference]: Without dead ends: 997 [2025-01-09 09:14:50,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:14:50,011 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 322 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:50,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 708 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:14:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-01-09 09:14:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 761. [2025-01-09 09:14:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 589 states have (on average 1.4838709677419355) internal successors, (874), 591 states have internal predecessors, (874), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 09:14:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1196 transitions. [2025-01-09 09:14:50,093 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1196 transitions. Word has length 253 [2025-01-09 09:14:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:50,093 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1196 transitions. [2025-01-09 09:14:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1196 transitions. [2025-01-09 09:14:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 09:14:50,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:50,095 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:50,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:14:50,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:50,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1795933523, now seen corresponding path program 1 times [2025-01-09 09:14:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581873181] [2025-01-09 09:14:50,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:50,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 09:14:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 09:14:50,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581873181] [2025-01-09 09:14:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581873181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:14:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844683500] [2025-01-09 09:14:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:50,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:14:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:14:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:14:50,399 INFO L87 Difference]: Start difference. First operand 761 states and 1196 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:50,677 INFO L93 Difference]: Finished difference Result 1366 states and 2165 transitions. [2025-01-09 09:14:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:14:50,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253 [2025-01-09 09:14:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:50,683 INFO L225 Difference]: With dead ends: 1366 [2025-01-09 09:14:50,684 INFO L226 Difference]: Without dead ends: 1039 [2025-01-09 09:14:50,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:14:50,685 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 385 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:50,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 716 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:14:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-01-09 09:14:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 781. [2025-01-09 09:14:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 609 states have (on average 1.4876847290640394) internal successors, (906), 611 states have internal predecessors, (906), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 09:14:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1228 transitions. [2025-01-09 09:14:50,779 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1228 transitions. Word has length 253 [2025-01-09 09:14:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:50,780 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1228 transitions. [2025-01-09 09:14:50,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1228 transitions. [2025-01-09 09:14:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 09:14:50,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:50,782 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:50,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:14:50,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:50,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1707825150, now seen corresponding path program 1 times [2025-01-09 09:14:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:50,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724926441] [2025-01-09 09:14:50,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:50,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 09:14:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 09:14:50,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724926441] [2025-01-09 09:14:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724926441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:14:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343729181] [2025-01-09 09:14:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:14:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:14:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:14:50,918 INFO L87 Difference]: Start difference. First operand 781 states and 1228 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:51,270 INFO L93 Difference]: Finished difference Result 1595 states and 2500 transitions. [2025-01-09 09:14:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:14:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2025-01-09 09:14:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:51,277 INFO L225 Difference]: With dead ends: 1595 [2025-01-09 09:14:51,277 INFO L226 Difference]: Without dead ends: 1032 [2025-01-09 09:14:51,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:14:51,280 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 286 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:51,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 639 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:14:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-01-09 09:14:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1026. [2025-01-09 09:14:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 802 states have (on average 1.4825436408977557) internal successors, (1189), 806 states have internal predecessors, (1189), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 09:14:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1607 transitions. [2025-01-09 09:14:51,400 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1607 transitions. Word has length 254 [2025-01-09 09:14:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:51,400 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1607 transitions. [2025-01-09 09:14:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1607 transitions. [2025-01-09 09:14:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 09:14:51,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:51,402 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:51,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:14:51,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:51,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2130526976, now seen corresponding path program 1 times [2025-01-09 09:14:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482868390] [2025-01-09 09:14:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 09:14:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 09:14:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-01-09 09:14:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482868390] [2025-01-09 09:14:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482868390] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:14:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233994691] [2025-01-09 09:14:51,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:51,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:51,785 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 09:14:51,785 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 09:14:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 09:14:51,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 09:14:51,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:51,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:51,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 09:14:51,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2025-01-09 09:14:52,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:14:52,488 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-09 09:14:52,496 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 09:14:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:52,690 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0 at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-01-09 09:14:52,696 INFO L158 Benchmark]: Toolchain (without parser) took 12086.29ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 110.8MB in the beginning and 351.0MB in the end (delta: -240.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2025-01-09 09:14:52,696 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:52,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.80ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 94.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:14:52,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.80ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:52,698 INFO L158 Benchmark]: Boogie Preprocessor took 65.17ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 85.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:14:52,698 INFO L158 Benchmark]: RCFGBuilder took 579.66ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 52.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 09:14:52,699 INFO L158 Benchmark]: TraceAbstraction took 11056.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 51.6MB in the beginning and 351.0MB in the end (delta: -299.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:52,700 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.80ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 94.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.80ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.17ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 85.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 579.66ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 52.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11056.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 51.6MB in the beginning and 351.0MB in the end (delta: -299.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-01-09 09:14:52,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-100_file-11.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:14:54,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:14:54,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:14:54,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:14:54,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:14:54,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:14:54,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:14:54,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:14:54,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:14:54,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:14:54,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:14:54,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:14:54,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:14:54,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:54,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:54,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:54,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:14:54,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:14:54,687 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2025-01-09 09:14:54,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:14:54,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:14:54,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:14:54,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:14:54,943 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:14:54,944 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-100_file-11.i [2025-01-09 09:14:56,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74efc9fd/ddebae7b9ec1454f8438e8393e3edd18/FLAG245df7a61 [2025-01-09 09:14:56,324 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:14:56,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2025-01-09 09:14:56,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74efc9fd/ddebae7b9ec1454f8438e8393e3edd18/FLAG245df7a61 [2025-01-09 09:14:56,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74efc9fd/ddebae7b9ec1454f8438e8393e3edd18 [2025-01-09 09:14:56,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:14:56,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:14:56,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:56,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:14:56,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:14:56,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb321bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56, skipping insertion in model container [2025-01-09 09:14:56,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:14:56,486 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-100_file-11.i[916,929] [2025-01-09 09:14:56,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:56,560 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:14:56,567 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-100_file-11.i[916,929] [2025-01-09 09:14:56,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:56,610 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:14:56,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56 WrapperNode [2025-01-09 09:14:56,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:56,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:56,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:14:56,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:14:56,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,661 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-01-09 09:14:56,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:56,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:14:56,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:14:56,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:14:56,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,688 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 09:14:56,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:14:56,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:14:56,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:14:56,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:14:56,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (1/1) ... [2025-01-09 09:14:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:56,743 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 09:14:56,746 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 09:14:56,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:14:56,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:14:56,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:14:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:14:56,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:14:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:14:56,863 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:14:56,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:14:57,482 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:14:57,483 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:14:57,494 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:14:57,494 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:14:57,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:57 BoogieIcfgContainer [2025-01-09 09:14:57,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:14:57,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:14:57,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:14:57,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:14:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:14:56" (1/3) ... [2025-01-09 09:14:57,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:57, skipping insertion in model container [2025-01-09 09:14:57,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:56" (2/3) ... [2025-01-09 09:14:57,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:57, skipping insertion in model container [2025-01-09 09:14:57,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:57" (3/3) ... [2025-01-09 09:14:57,504 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2025-01-09 09:14:57,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:14:57,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:14:57,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:14:57,577 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;@1da44c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:14:57,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:14:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-09 09:14:57,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:57,593 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:57,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:57,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2091348576, now seen corresponding path program 1 times [2025-01-09 09:14:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411787789] [2025-01-09 09:14:57,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:57,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:14:57,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:57,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:14:57,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 09:14:57,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 09:14:57,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 09:14:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:57,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:14:57,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2025-01-09 09:14:58,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:58,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411787789] [2025-01-09 09:14:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411787789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:58,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:14:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285435759] [2025-01-09 09:14:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:58,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:14:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:58,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:14:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:14:58,060 INFO L87 Difference]: Start difference. First operand has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 09:14:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:58,082 INFO L93 Difference]: Finished difference Result 220 states and 402 transitions. [2025-01-09 09:14:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:14:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 246 [2025-01-09 09:14:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:58,088 INFO L225 Difference]: With dead ends: 220 [2025-01-09 09:14:58,088 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 09:14:58,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 245 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 09:14:58,093 INFO L435 NwaCegarLoop]: 177 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, 177 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 09:14:58,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 09:14:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 09:14:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:14:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2025-01-09 09:14:58,134 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246 [2025-01-09 09:14:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:58,134 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2025-01-09 09:14:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 09:14:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2025-01-09 09:14:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-09 09:14:58,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:58,138 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:58,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 09:14:58,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:14:58,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:58,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1382232290, now seen corresponding path program 1 times [2025-01-09 09:14:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:58,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590681755] [2025-01-09 09:14:58,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:58,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:14:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:58,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:14:58,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 09:14:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 09:14:58,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 09:14:58,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:58,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:58,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:14:58,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:14:58,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:58,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:58,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590681755] [2025-01-09 09:14:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590681755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886604890] [2025-01-09 09:14:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:58,783 INFO L87 Difference]: Start difference. First operand 110 states and 177 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:58,844 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2025-01-09 09:14:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2025-01-09 09:14:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:58,846 INFO L225 Difference]: With dead ends: 290 [2025-01-09 09:14:58,846 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 09:14:58,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 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 09:14:58,848 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:58,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 09:14:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2025-01-09 09:14:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 117 states have internal predecessors, (168), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 09:14:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2025-01-09 09:14:58,871 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246 [2025-01-09 09:14:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:58,873 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2025-01-09 09:14:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:14:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2025-01-09 09:14:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-09 09:14:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:58,877 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:58,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 09:14:59,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:14:59,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:59,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1163377572, now seen corresponding path program 1 times [2025-01-09 09:14:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:59,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647592906] [2025-01-09 09:14:59,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:59,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:14:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:59,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:14:59,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:14:59,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 09:14:59,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 09:14:59,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:59,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:59,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:14:59,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:15:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:15:00,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:15:00,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:15:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647592906] [2025-01-09 09:15:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647592906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:15:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:15:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:15:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897436763] [2025-01-09 09:15:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:15:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:15:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:15:00,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:15:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:15:00,328 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:15:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:00,708 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2025-01-09 09:15:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:15:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2025-01-09 09:15:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:00,713 INFO L225 Difference]: With dead ends: 498 [2025-01-09 09:15:00,716 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 09:15:00,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:15:00,718 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:00,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:15:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 09:15:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287. [2025-01-09 09:15:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 183 states have (on average 1.459016393442623) internal successors, (267), 184 states have internal predecessors, (267), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 09:15:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2025-01-09 09:15:00,751 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246 [2025-01-09 09:15:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:00,751 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2025-01-09 09:15:00,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:15:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2025-01-09 09:15:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 09:15:00,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:00,754 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:00,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 09:15:00,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:00,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:00,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -238907068, now seen corresponding path program 1 times [2025-01-09 09:15:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:15:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653562302] [2025-01-09 09:15:00,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:15:00,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:15:00,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 09:15:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 09:15:01,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 09:15:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:01,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:01,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:15:01,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:15:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2025-01-09 09:15:01,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:15:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-01-09 09:15:01,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:15:01,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653562302] [2025-01-09 09:15:01,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653562302] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:15:01,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:15:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-01-09 09:15:01,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30356485] [2025-01-09 09:15:01,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:15:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:15:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:15:01,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:15:01,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:15:01,838 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:15:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:02,296 INFO L93 Difference]: Finished difference Result 488 states and 775 transitions. [2025-01-09 09:15:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:15:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 247 [2025-01-09 09:15:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:02,301 INFO L225 Difference]: With dead ends: 488 [2025-01-09 09:15:02,301 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 09:15:02,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:15:02,303 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 319 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 308 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:15:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 09:15:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2025-01-09 09:15:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.4166666666666667) internal successors, (272), 193 states have internal predecessors, (272), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 09:15:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2025-01-09 09:15:02,351 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247 [2025-01-09 09:15:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2025-01-09 09:15:02,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:15:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2025-01-09 09:15:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 09:15:02,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:02,354 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:02,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 09:15:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:02,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1916361399, now seen corresponding path program 1 times [2025-01-09 09:15:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:15:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536984692] [2025-01-09 09:15:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:02,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:02,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:15:02,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:15:02,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 09:15:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 09:15:02,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 09:15:02,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:02,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:02,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 09:15:02,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:15:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 09:15:03,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:15:03,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:15:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536984692] [2025-01-09 09:15:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536984692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:15:03,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:15:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:15:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063071875] [2025-01-09 09:15:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:15:03,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:15:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:15:03,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:15:03,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:15:03,195 INFO L87 Difference]: Start difference. First operand 299 states and 472 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:15:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:04,014 INFO L93 Difference]: Finished difference Result 492 states and 773 transitions. [2025-01-09 09:15:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:15:04,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2025-01-09 09:15:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:04,017 INFO L225 Difference]: With dead ends: 492 [2025-01-09 09:15:04,017 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 09:15:04,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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 09:15:04,019 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:04,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:15:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 09:15:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2025-01-09 09:15:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 193 states have internal predecessors, (268), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 09:15:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions. [2025-01-09 09:15:04,047 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248 [2025-01-09 09:15:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 468 transitions. [2025-01-09 09:15:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 09:15:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions. [2025-01-09 09:15:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 09:15:04,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:04,050 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:04,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 09:15:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:04,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -569359818, now seen corresponding path program 1 times [2025-01-09 09:15:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:15:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014716692] [2025-01-09 09:15:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:15:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:15:04,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:15:04,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 09:15:04,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 09:15:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 09:15:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:04,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 09:15:04,548 INFO L279 TraceCheckSpWp]: Computing forward predicates...