./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_4.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/combinations/gcd_4+newton_3_4.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 f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:39:56,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:39:57,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:39:57,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:39:57,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:39:57,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:39:57,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:39:57,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:39:57,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:39:57,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:39:57,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:39:57,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:39:57,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:39:57,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:39:57,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:39:57,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:39:57,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:39:57,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:39:57,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:39:57,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:39:57,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:39:57,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:39:57,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:39:57,038 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2025-01-09 05:39:57,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:39:57,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:39:57,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:39:57,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:39:57,295 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:39:57,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-01-09 05:39:58,499 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/410c11386/4465472b87024994b7da92d16105e60f/FLAG94ba79747 [2025-01-09 05:39:58,753 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:39:58,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-01-09 05:39:58,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/410c11386/4465472b87024994b7da92d16105e60f/FLAG94ba79747 [2025-01-09 05:39:59,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/410c11386/4465472b87024994b7da92d16105e60f [2025-01-09 05:39:59,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:39:59,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:39:59,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:39:59,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:39:59,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:39:59,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55665255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59, skipping insertion in model container [2025-01-09 05:39:59,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:39:59,181 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2025-01-09 05:39:59,200 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2025-01-09 05:39:59,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:39:59,220 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:39:59,227 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2025-01-09 05:39:59,233 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2025-01-09 05:39:59,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:39:59,244 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:39:59,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59 WrapperNode [2025-01-09 05:39:59,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:39:59,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:39:59,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:39:59,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:39:59,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,265 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2025-01-09 05:39:59,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:39:59,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:39:59,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:39:59,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:39:59,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,281 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 05:39:59,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:39:59,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:39:59,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:39:59,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:39:59,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (1/1) ... [2025-01-09 05:39:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:39:59,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:39:59,318 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 05:39:59,324 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 05:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-01-09 05:39:59,339 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-01-09 05:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 05:39:59,339 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 05:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:39:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:39:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:39:59,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:39:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 05:39:59,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 05:39:59,387 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:39:59,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:39:59,547 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 05:39:59,548 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:39:59,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:39:59,557 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:39:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:39:59 BoogieIcfgContainer [2025-01-09 05:39:59,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:39:59,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:39:59,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:39:59,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:39:59,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:39:59" (1/3) ... [2025-01-09 05:39:59,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577bb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:39:59, skipping insertion in model container [2025-01-09 05:39:59,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:39:59" (2/3) ... [2025-01-09 05:39:59,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577bb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:39:59, skipping insertion in model container [2025-01-09 05:39:59,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:39:59" (3/3) ... [2025-01-09 05:39:59,566 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2025-01-09 05:39:59,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:39:59,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_4.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 05:39:59,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:39:59,625 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;@2a88756e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:39:59,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:39:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 05:39:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 05:39:59,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:39:59,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:39:59,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:39:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:39:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1787067343, now seen corresponding path program 1 times [2025-01-09 05:39:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:39:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973241858] [2025-01-09 05:39:59,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:39:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:39:59,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 05:39:59,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 05:39:59,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:39:59,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:39:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:39:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:39:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973241858] [2025-01-09 05:39:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973241858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:39:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:39:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:39:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151327334] [2025-01-09 05:39:59,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:39:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:39:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:39:59,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:39:59,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:39:59,922 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:39:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:39:59,960 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-01-09 05:39:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:39:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 05:39:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:39:59,966 INFO L225 Difference]: With dead ends: 87 [2025-01-09 05:39:59,966 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 05:39:59,969 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 05:39:59,970 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:39:59,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:39:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 05:39:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-09 05:39:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:39:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-01-09 05:39:59,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-01-09 05:39:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:39:59,998 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-09 05:39:59,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:39:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-01-09 05:39:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 05:39:59,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:00,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:00,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:40:00,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:00,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1509370903, now seen corresponding path program 1 times [2025-01-09 05:40:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-01-09 05:40:00,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 05:40:00,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 05:40:00,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:00,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-01-09 05:40:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676853367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:40:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:40:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:40:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783569351] [2025-01-09 05:40:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:40:00,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:40:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:00,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:40:00,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:40:00,095 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:00,114 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-01-09 05:40:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:40:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 05:40:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:00,117 INFO L225 Difference]: With dead ends: 53 [2025-01-09 05:40:00,117 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 05:40:00,117 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 05:40:00,118 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:00,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:40:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 05:40:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 05:40:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-01-09 05:40:00,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 12 [2025-01-09 05:40:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-09 05:40:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-01-09 05:40:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 05:40:00,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:00,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:40:00,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1983253012, now seen corresponding path program 1 times [2025-01-09 05:40:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184134069] [2025-01-09 05:40:00,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 05:40:00,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 05:40:00,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:00,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184134069] [2025-01-09 05:40:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184134069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:40:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:40:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:40:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649697194] [2025-01-09 05:40:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:40:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:40:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:40:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:40:00,242 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:00,258 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-01-09 05:40:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:40:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 05:40:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:00,260 INFO L225 Difference]: With dead ends: 54 [2025-01-09 05:40:00,260 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 05:40:00,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:40:00,261 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:00,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:40:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 05:40:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 05:40:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-01-09 05:40:00,267 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 14 [2025-01-09 05:40:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:00,267 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-01-09 05:40:00,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-01-09 05:40:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 05:40:00,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:00,268 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:40:00,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1890509551, now seen corresponding path program 1 times [2025-01-09 05:40:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120279535] [2025-01-09 05:40:00,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:00,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 05:40:00,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 05:40:00,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:00,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120279535] [2025-01-09 05:40:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120279535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:40:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488704297] [2025-01-09 05:40:00,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:00,430 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 05:40:00,431 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 05:40:00,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 05:40:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 05:40:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:00,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 05:40:00,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:00,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488704297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:00,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:40:00,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-01-09 05:40:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855500768] [2025-01-09 05:40:00,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:00,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:40:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:00,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:40:00,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:40:00,648 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:00,697 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-01-09 05:40:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:40:00,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 05:40:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:00,700 INFO L225 Difference]: With dead ends: 58 [2025-01-09 05:40:00,700 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 05:40:00,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:40:00,701 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:00,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:40:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 05:40:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 05:40:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-09 05:40:00,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-01-09 05:40:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:00,706 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-09 05:40:00,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-01-09 05:40:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:40:00,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:00,707 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:00,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:40:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:00,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 316493493, now seen corresponding path program 2 times [2025-01-09 05:40:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667566639] [2025-01-09 05:40:00,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:40:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:00,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 05:40:00,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:40:00,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 05:40:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667566639] [2025-01-09 05:40:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667566639] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:40:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001825620] [2025-01-09 05:40:01,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:40:01,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:01,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:01,063 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 05:40:01,065 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 05:40:01,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 05:40:01,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:40:01,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 05:40:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:01,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 05:40:01,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:01,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001825620] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:01,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:40:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 05:40:01,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195265073] [2025-01-09 05:40:01,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 05:40:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:01,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 05:40:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:40:01,262 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:01,360 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-01-09 05:40:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:40:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 05:40:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:01,362 INFO L225 Difference]: With dead ends: 67 [2025-01-09 05:40:01,362 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 05:40:01,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:40:01,363 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:01,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 291 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 05:40:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-01-09 05:40:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-09 05:40:01,375 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-01-09 05:40:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:01,375 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-09 05:40:01,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-09 05:40:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:40:01,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:01,376 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:01,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:40:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:01,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:01,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 718801786, now seen corresponding path program 3 times [2025-01-09 05:40:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:01,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720200387] [2025-01-09 05:40:01,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 05:40:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:01,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-01-09 05:40:01,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:40:01,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 05:40:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 05:40:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468321999] [2025-01-09 05:40:01,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 05:40:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:01,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:40:01,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:40:01,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-01-09 05:40:01,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 22 statements. [2025-01-09 05:40:01,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 05:40:01,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:01,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 05:40:01,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:40:01,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:40:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720200387] [2025-01-09 05:40:02,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 05:40:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468321999] [2025-01-09 05:40:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468321999] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:02,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-01-09 05:40:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088116755] [2025-01-09 05:40:02,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 05:40:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:02,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 05:40:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:40:02,052 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:02,269 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2025-01-09 05:40:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 05:40:02,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:40:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:02,271 INFO L225 Difference]: With dead ends: 72 [2025-01-09 05:40:02,271 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 05:40:02,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:40:02,271 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:02,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 391 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 05:40:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-01-09 05:40:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 05:40:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-01-09 05:40:02,283 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2025-01-09 05:40:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:02,283 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-01-09 05:40:02,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-01-09 05:40:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:40:02,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:02,288 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:02,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:40:02,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:02,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:02,490 INFO L85 PathProgramCache]: Analyzing trace with hash 790014719, now seen corresponding path program 4 times [2025-01-09 05:40:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:02,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81423080] [2025-01-09 05:40:02,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 05:40:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:02,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-09 05:40:02,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:40:02,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 05:40:02,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81423080] [2025-01-09 05:40:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81423080] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:40:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140415715] [2025-01-09 05:40:02,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 05:40:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:02,626 INFO L229 MonitoredProcess]: Starting monitored process 5 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 05:40:02,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:40:02,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-09 05:40:02,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:40:02,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 05:40:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:02,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:40:02,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:02,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140415715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:02,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:40:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-01-09 05:40:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995062891] [2025-01-09 05:40:02,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:02,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:40:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:02,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:40:02,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:40:02,907 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:03,069 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2025-01-09 05:40:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:40:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 05:40:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:03,071 INFO L225 Difference]: With dead ends: 86 [2025-01-09 05:40:03,071 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 05:40:03,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:40:03,072 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:03,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 434 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 05:40:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 05:40:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 05:40:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-01-09 05:40:03,087 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 24 [2025-01-09 05:40:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-01-09 05:40:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-01-09 05:40:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 05:40:03,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:03,088 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:03,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:40:03,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 05:40:03,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:03,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:03,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2015702026, now seen corresponding path program 1 times [2025-01-09 05:40:03,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:03,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-01-09 05:40:03,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:03,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 05:40:03,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 05:40:03,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:03,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 05:40:03,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129305405] [2025-01-09 05:40:03,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:03,319 INFO L229 MonitoredProcess]: Starting monitored process 6 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 05:40:03,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:40:03,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 05:40:03,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 05:40:03,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:03,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:03,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 05:40:03,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:40:03,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:40:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-01-09 05:40:03,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 05:40:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129305405] [2025-01-09 05:40:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129305405] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:03,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-01-09 05:40:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578987032] [2025-01-09 05:40:03,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 05:40:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:03,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 05:40:03,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:40:03,684 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 05:40:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:03,866 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-01-09 05:40:03,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:40:03,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-09 05:40:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:03,868 INFO L225 Difference]: With dead ends: 65 [2025-01-09 05:40:03,868 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 05:40:03,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 05:40:03,868 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:03,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 504 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 05:40:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 05:40:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-01-09 05:40:03,878 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 27 [2025-01-09 05:40:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:03,878 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-01-09 05:40:03,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 05:40:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-01-09 05:40:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:40:03,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:03,879 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:03,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:40:04,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:04,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -194897982, now seen corresponding path program 5 times [2025-01-09 05:40:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:04,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790401584] [2025-01-09 05:40:04,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 05:40:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:04,087 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-01-09 05:40:04,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:40:04,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-09 05:40:04,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:40:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:40:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790401584] [2025-01-09 05:40:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790401584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:40:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892760689] [2025-01-09 05:40:04,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 05:40:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:04,168 INFO L229 MonitoredProcess]: Starting monitored process 7 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 05:40:04,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:40:04,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-01-09 05:40:04,206 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:40:04,206 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-09 05:40:04,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:04,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 05:40:04,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:04,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892760689] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:04,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:40:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-01-09 05:40:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142922926] [2025-01-09 05:40:04,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:40:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:40:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:40:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:40:04,462 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:04,528 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-01-09 05:40:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:40:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 05:40:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:04,529 INFO L225 Difference]: With dead ends: 51 [2025-01-09 05:40:04,529 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 05:40:04,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-01-09 05:40:04,531 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:04,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:40:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 05:40:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 05:40:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 05:40:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-01-09 05:40:04,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 26 [2025-01-09 05:40:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:04,533 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-09 05:40:04,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-01-09 05:40:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 05:40:04,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:04,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 05:40:04,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:40:04,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 05:40:04,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:04,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1996948111, now seen corresponding path program 1 times [2025-01-09 05:40:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:40:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391678848] [2025-01-09 05:40:04,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:40:04,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 05:40:04,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 05:40:04,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:04,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:40:04,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 05:40:04,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 05:40:04,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 05:40:04,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:04,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:40:04,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 05:40:04,775 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 05:40:04,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 05:40:04,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 05:40:04,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:40:04,779 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-01-09 05:40:04,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 05:40:04,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 05:40:04 BoogieIcfgContainer [2025-01-09 05:40:04,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 05:40:04,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 05:40:04,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 05:40:04,800 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 05:40:04,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:39:59" (3/4) ... [2025-01-09 05:40:04,802 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 05:40:04,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 05:40:04,803 INFO L158 Benchmark]: Toolchain (without parser) took 5744.00ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 113.0MB in the end (delta: 8.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2025-01-09 05:40:04,803 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:40:04,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.89ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:40:04,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.99ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:40:04,804 INFO L158 Benchmark]: Boogie Preprocessor took 24.08ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:40:04,805 INFO L158 Benchmark]: RCFGBuilder took 267.61ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 92.9MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:40:04,805 INFO L158 Benchmark]: TraceAbstraction took 5239.97ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 113.1MB in the end (delta: -21.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:40:04,805 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 113.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:40:04,806 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.28ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.89ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.99ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.08ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.61ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 92.9MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5239.97ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 113.1MB in the end (delta: -21.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 113.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L100] CALL, EXPR f(IN) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L100] RET, EXPR f(IN) VAL [IN=112] [L100] CALL, EXPR fp(IN) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L100] RET, EXPR fp(IN) VAL [IN=112] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=112, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=112, x=110] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L104] RET, EXPR f(x) VAL [IN=112, x=111] [L104] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L104] RET, EXPR fp(x) VAL [IN=112, x=111] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=112] [L109] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 2477 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2131 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 346 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 341 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 18 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 106/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 05:40:04,822 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/combinations/gcd_4+newton_3_4.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 f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:40:06,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:40:06,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 05:40:06,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:40:06,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:40:06,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:40:06,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:40:06,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:40:06,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:40:06,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:40:06,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:40:06,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:40:06,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:40:06,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:40:06,762 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:40:06,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:40:06,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:40:06,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:40:06,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:40:06,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:40:06,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:40:06,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 05:40:06,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:40:06,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:40:06,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:40:06,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:40:06,767 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2025-01-09 05:40:07,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:40:07,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:40:07,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:40:07,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:40:07,041 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:40:07,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-01-09 05:40:08,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74909c129/3197dd836ec54c10bbea17f7c3a0ea64/FLAG04d8867c4 [2025-01-09 05:40:08,412 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:40:08,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-01-09 05:40:08,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74909c129/3197dd836ec54c10bbea17f7c3a0ea64/FLAG04d8867c4 [2025-01-09 05:40:08,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74909c129/3197dd836ec54c10bbea17f7c3a0ea64 [2025-01-09 05:40:08,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:40:08,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:40:08,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:40:08,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:40:08,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:40:08,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cae0bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08, skipping insertion in model container [2025-01-09 05:40:08,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:40:08,585 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2025-01-09 05:40:08,620 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2025-01-09 05:40:08,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:40:08,637 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:40:08,646 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2025-01-09 05:40:08,661 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2025-01-09 05:40:08,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:40:08,677 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:40:08,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08 WrapperNode [2025-01-09 05:40:08,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:40:08,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:40:08,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:40:08,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:40:08,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,714 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2025-01-09 05:40:08,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:40:08,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:40:08,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:40:08,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:40:08,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,733 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 05:40:08,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:40:08,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:40:08,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:40:08,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:40:08,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (1/1) ... [2025-01-09 05:40:08,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:40:08,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:08,776 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 05:40:08,780 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 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-01-09 05:40:08,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 05:40:08,800 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:40:08,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:40:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 05:40:08,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 05:40:08,866 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:40:08,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:40:23,482 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 05:40:23,482 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:40:23,489 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:40:23,490 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:40:23,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:40:23 BoogieIcfgContainer [2025-01-09 05:40:23,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:40:23,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:40:23,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:40:23,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:40:23,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:40:08" (1/3) ... [2025-01-09 05:40:23,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d59ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:40:23, skipping insertion in model container [2025-01-09 05:40:23,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:40:08" (2/3) ... [2025-01-09 05:40:23,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d59ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:40:23, skipping insertion in model container [2025-01-09 05:40:23,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:40:23" (3/3) ... [2025-01-09 05:40:23,497 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2025-01-09 05:40:23,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:40:23,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_4.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 05:40:23,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:40:23,554 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;@4d48a98c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:40:23,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:40:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 05:40:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 05:40:23,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:23,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:23,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1787067343, now seen corresponding path program 1 times [2025-01-09 05:40:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954691804] [2025-01-09 05:40:23,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:23,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:23,576 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 05:40:23,578 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 05:40:23,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 05:40:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 05:40:23,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:23,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 05:40:23,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:23,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:40:23,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954691804] [2025-01-09 05:40:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954691804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:40:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:40:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:40:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678390935] [2025-01-09 05:40:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:40:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:40:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:23,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:40:23,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:40:23,768 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:23,878 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-01-09 05:40:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:40:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 05:40:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:23,884 INFO L225 Difference]: With dead ends: 87 [2025-01-09 05:40:23,884 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 05:40:23,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 05:40:23,887 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:23,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 05:40:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-09 05:40:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-01-09 05:40:23,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-01-09 05:40:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:23,914 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-09 05:40:23,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-01-09 05:40:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 05:40:23,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:23,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:23,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:40:24,116 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 [2025-01-09 05:40:24,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:24,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1509370903, now seen corresponding path program 1 times [2025-01-09 05:40:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133217753] [2025-01-09 05:40:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:24,120 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 05:40:24,120 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 05:40:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 05:40:24,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 05:40:24,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:24,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:24,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 05:40:24,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:24,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:40:24,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133217753] [2025-01-09 05:40:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133217753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:40:24,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:40:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:40:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506874607] [2025-01-09 05:40:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:40:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:40:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:24,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:40:24,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:40:24,256 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:24,367 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-01-09 05:40:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:40:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 05:40:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:24,368 INFO L225 Difference]: With dead ends: 53 [2025-01-09 05:40:24,369 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 05:40:24,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 05:40:24,369 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:24,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:40:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 05:40:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 05:40:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-01-09 05:40:24,374 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 12 [2025-01-09 05:40:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-09 05:40:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-01-09 05:40:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 05:40:24,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:24,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:24,387 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 05:40:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:24,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1983253012, now seen corresponding path program 1 times [2025-01-09 05:40:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377820721] [2025-01-09 05:40:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:24,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:40:24,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:40:24,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 05:40:24,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 05:40:24,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:24,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:24,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 05:40:24,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:25,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:25,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377820721] [2025-01-09 05:40:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377820721] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:25,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 05:40:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278648515] [2025-01-09 05:40:25,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:25,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:40:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:40:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:40:25,295 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:25,671 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-01-09 05:40:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:40:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 05:40:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:25,673 INFO L225 Difference]: With dead ends: 57 [2025-01-09 05:40:25,673 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 05:40:25,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:40:25,674 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:25,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:40:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 05:40:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-09 05:40:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-09 05:40:25,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-01-09 05:40:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:25,686 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-09 05:40:25,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-01-09 05:40:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 05:40:25,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:25,687 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:25,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:40:25,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:25,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1519745332, now seen corresponding path program 1 times [2025-01-09 05:40:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145462721] [2025-01-09 05:40:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:25,891 INFO L229 MonitoredProcess]: Starting monitored process 5 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 05:40:25,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:40:25,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 05:40:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 05:40:25,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:25,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 05:40:25,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 05:40:26,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 05:40:27,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145462721] [2025-01-09 05:40:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145462721] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:27,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2025-01-09 05:40:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039529659] [2025-01-09 05:40:27,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:27,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:40:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:27,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:40:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:40:27,018 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:27,328 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-01-09 05:40:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:40:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 05:40:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:27,330 INFO L225 Difference]: With dead ends: 58 [2025-01-09 05:40:27,330 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 05:40:27,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:40:27,330 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:27,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:40:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 05:40:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 05:40:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-01-09 05:40:27,335 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 18 [2025-01-09 05:40:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:27,335 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-01-09 05:40:27,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-01-09 05:40:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:40:27,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:27,336 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:27,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:40:27,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:27,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:27,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 316493493, now seen corresponding path program 2 times [2025-01-09 05:40:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594203187] [2025-01-09 05:40:27,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:40:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:27,540 INFO L229 MonitoredProcess]: Starting monitored process 6 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 05:40:27,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:40:27,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 05:40:27,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:40:27,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 05:40:27,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:27,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 05:40:27,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:28,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:29,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594203187] [2025-01-09 05:40:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594203187] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:29,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 05:40:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406597461] [2025-01-09 05:40:29,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:29,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 05:40:29,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:29,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 05:40:29,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:40:29,454 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:31,897 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2025-01-09 05:40:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 05:40:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 05:40:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:31,899 INFO L225 Difference]: With dead ends: 78 [2025-01-09 05:40:31,899 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 05:40:31,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:40:31,900 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:31,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:40:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 05:40:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-01-09 05:40:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 52 states have internal predecessors, (63), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 05:40:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-01-09 05:40:31,907 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 20 [2025-01-09 05:40:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:31,907 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-01-09 05:40:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-01-09 05:40:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:40:31,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:31,908 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:31,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:40:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:32,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:32,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 718801786, now seen corresponding path program 3 times [2025-01-09 05:40:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042537450] [2025-01-09 05:40:32,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 05:40:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:32,115 INFO L229 MonitoredProcess]: Starting monitored process 7 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 05:40:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:40:32,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-01-09 05:40:32,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:40:32,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 05:40:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:32,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:40:32,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:40:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:34,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:40:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:40:52,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:40:52,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042537450] [2025-01-09 05:40:52,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042537450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:40:52,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:40:52,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2025-01-09 05:40:52,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837991266] [2025-01-09 05:40:52,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:40:52,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 05:40:52,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:40:52,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 05:40:52,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-01-09 05:40:52,198 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 24 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:40:57,022 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2025-01-09 05:40:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 05:40:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:40:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:40:57,024 INFO L225 Difference]: With dead ends: 79 [2025-01-09 05:40:57,024 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 05:40:57,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:40:57,025 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:40:57,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 484 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 05:40:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 05:40:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 05:40:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 05:40:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-01-09 05:40:57,032 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2025-01-09 05:40:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:40:57,032 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-01-09 05:40:57,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:40:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-01-09 05:40:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 05:40:57,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:40:57,034 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:40:57,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:40:57,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:57,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:40:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:40:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2015702026, now seen corresponding path program 1 times [2025-01-09 05:40:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:40:57,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567584927] [2025-01-09 05:40:57,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:40:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:40:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:40:57,238 INFO L229 MonitoredProcess]: Starting monitored process 8 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 05:40:57,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:40:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 05:40:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 05:40:57,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:40:57,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:40:57,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:40:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:41:00,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:41:28,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 05:41:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567584927] [2025-01-09 05:41:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567584927] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:28,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:41:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2025-01-09 05:41:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228342255] [2025-01-09 05:41:28,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:28,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 05:41:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 05:41:28,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 05:41:28,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-01-09 05:41:28,671 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 24 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 05:41:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:37,966 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-01-09 05:41:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:41:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-09 05:41:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:37,973 INFO L225 Difference]: With dead ends: 48 [2025-01-09 05:41:37,973 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 05:41:37,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:41:37,974 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:37,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 291 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 05:41:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 05:41:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 05:41:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 05:41:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-01-09 05:41:37,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 27 [2025-01-09 05:41:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-09 05:41:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 05:41:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-01-09 05:41:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 05:41:37,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:37,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 05:41:37,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:41:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:38,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1996948111, now seen corresponding path program 1 times [2025-01-09 05:41:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 05:41:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107486376] [2025-01-09 05:41:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:38,178 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 05:41:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 05:41:38,180 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:41:38,181 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 (9)] Waiting until timeout for monitored process [2025-01-09 05:41:38,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.