./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.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 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:52:41,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:52:41,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:52:41,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:52:41,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:52:41,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:52:41,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:52:41,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:52:41,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:52:41,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:52:41,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:52:41,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:52:41,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:52:41,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:52:41,876 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:52:41,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:52:41,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:52:41,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:52:41,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:52:41,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:52:41,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:52:41,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:52:41,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:52:41,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:52:41,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:52:41,879 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 -> 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 [2025-01-09 10:52:42,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:52:42,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:52:42,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:52:42,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:52:42,064 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:52:42,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-01-09 10:52:43,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cdb6143f/14cb1875c4124945a6ffe64c3545f6f5/FLAG224c69761 [2025-01-09 10:52:43,582 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:52:43,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-01-09 10:52:43,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cdb6143f/14cb1875c4124945a6ffe64c3545f6f5/FLAG224c69761 [2025-01-09 10:52:43,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cdb6143f/14cb1875c4124945a6ffe64c3545f6f5 [2025-01-09 10:52:43,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:52:43,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:52:43,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:52:43,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:52:43,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:52:43,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:52:43" (1/1) ... [2025-01-09 10:52:43,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:43, skipping insertion in model container [2025-01-09 10:52:43,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:52:43" (1/1) ... [2025-01-09 10:52:43,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:52:43,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2025-01-09 10:52:44,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:52:44,065 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:52:44,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2025-01-09 10:52:44,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:52:44,129 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:52:44,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44 WrapperNode [2025-01-09 10:52:44,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:52:44,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:52:44,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:52:44,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:52:44,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,180 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-01-09 10:52:44,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:52:44,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:52:44,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:52:44,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:52:44,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,221 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:52:44,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:52:44,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:52:44,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:52:44,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:52:44,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (1/1) ... [2025-01-09 10:52:44,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:52:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:52:44,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:52:44,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:52:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:52:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:52:44,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:52:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:52:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:52:44,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:52:44,361 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:52:44,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:52:44,652 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:52:44,652 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:52:44,659 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:52:44,659 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:52:44,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:52:44 BoogieIcfgContainer [2025-01-09 10:52:44,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:52:44,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:52:44,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:52:44,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:52:44,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:52:43" (1/3) ... [2025-01-09 10:52:44,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f125548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:52:44, skipping insertion in model container [2025-01-09 10:52:44,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:52:44" (2/3) ... [2025-01-09 10:52:44,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f125548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:52:44, skipping insertion in model container [2025-01-09 10:52:44,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:52:44" (3/3) ... [2025-01-09 10:52:44,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2025-01-09 10:52:44,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:52:44,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:52:44,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:52:44,734 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;@436e9673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:52:44,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:52:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 10:52:44,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:44,747 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:44,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:44,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash -498536489, now seen corresponding path program 1 times [2025-01-09 10:52:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367766247] [2025-01-09 10:52:44,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:44,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 10:52:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 10:52:44,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:44,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 10:52:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367766247] [2025-01-09 10:52:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367766247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:52:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329609546] [2025-01-09 10:52:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:45,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:52:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:52:45,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:52:45,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:52:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 10:52:45,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 10:52:45,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:45,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:45,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:52:45,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 10:52:45,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:52:45,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329609546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:45,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:52:45,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:52:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584454974] [2025-01-09 10:52:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:45,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:52:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:45,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:52:45,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:52:45,374 INFO L87 Difference]: Start difference. First operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:52:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:45,396 INFO L93 Difference]: Finished difference Result 207 states and 359 transitions. [2025-01-09 10:52:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:52:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2025-01-09 10:52:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:45,403 INFO L225 Difference]: With dead ends: 207 [2025-01-09 10:52:45,403 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 10:52:45,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:52:45,407 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:45,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:52:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 10:52:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 10:52:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-01-09 10:52:45,440 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 226 [2025-01-09 10:52:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-01-09 10:52:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:52:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-01-09 10:52:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 10:52:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:45,444 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:45,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:52:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:52:45,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:45,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 931532517, now seen corresponding path program 1 times [2025-01-09 10:52:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314059696] [2025-01-09 10:52:45,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:45,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 10:52:45,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 10:52:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314059696] [2025-01-09 10:52:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314059696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:52:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118174631] [2025-01-09 10:52:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:45,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:52:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:45,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:52:45,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:45,889 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:45,944 INFO L93 Difference]: Finished difference Result 302 states and 463 transitions. [2025-01-09 10:52:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:52:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2025-01-09 10:52:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:45,949 INFO L225 Difference]: With dead ends: 302 [2025-01-09 10:52:45,950 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 10:52:45,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:45,951 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 145 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:45,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 301 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:52:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 10:52:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 113. [2025-01-09 10:52:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-01-09 10:52:45,975 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 226 [2025-01-09 10:52:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-01-09 10:52:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-01-09 10:52:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 10:52:45,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:45,981 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:45,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:52:45,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:45,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -79584733, now seen corresponding path program 1 times [2025-01-09 10:52:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810595049] [2025-01-09 10:52:45,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:45,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:46,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 10:52:46,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 10:52:46,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:46,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810595049] [2025-01-09 10:52:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810595049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:46,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:46,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:52:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101814246] [2025-01-09 10:52:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:52:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:46,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:52:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:46,165 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:46,193 INFO L93 Difference]: Finished difference Result 224 states and 343 transitions. [2025-01-09 10:52:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:52:46,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2025-01-09 10:52:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:46,198 INFO L225 Difference]: With dead ends: 224 [2025-01-09 10:52:46,198 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 10:52:46,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:46,199 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:46,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:52:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 10:52:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 10:52:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2025-01-09 10:52:46,212 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 226 [2025-01-09 10:52:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:46,213 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2025-01-09 10:52:46,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2025-01-09 10:52:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:46,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:46,218 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:46,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:52:46,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1592280407, now seen corresponding path program 1 times [2025-01-09 10:52:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259208777] [2025-01-09 10:52:46,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:46,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:46,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:46,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:46,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259208777] [2025-01-09 10:52:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259208777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:46,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:52:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151079972] [2025-01-09 10:52:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:52:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:46,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:52:46,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:46,421 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:46,454 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2025-01-09 10:52:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:52:46,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-01-09 10:52:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:46,456 INFO L225 Difference]: With dead ends: 291 [2025-01-09 10:52:46,458 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 10:52:46,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:46,459 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 353 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 10:52:46,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 353 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:52:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 10:52:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2025-01-09 10:52:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2025-01-09 10:52:46,475 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 227 [2025-01-09 10:52:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:46,476 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2025-01-09 10:52:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2025-01-09 10:52:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:46,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:46,479 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:52:46,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:46,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1594127449, now seen corresponding path program 1 times [2025-01-09 10:52:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553333981] [2025-01-09 10:52:46,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:46,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:46,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:46,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:46,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553333981] [2025-01-09 10:52:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553333981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:52:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282049283] [2025-01-09 10:52:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:46,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:52:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:46,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:52:46,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:52:46,662 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:46,813 INFO L93 Difference]: Finished difference Result 315 states and 477 transitions. [2025-01-09 10:52:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:52:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-01-09 10:52:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:46,816 INFO L225 Difference]: With dead ends: 315 [2025-01-09 10:52:46,816 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 10:52:46,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:52:46,817 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 148 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 355 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:46,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 355 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:52:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 10:52:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2025-01-09 10:52:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:52:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2025-01-09 10:52:46,825 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 227 [2025-01-09 10:52:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:46,826 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2025-01-09 10:52:46,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2025-01-09 10:52:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:46,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:46,828 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:46,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:52:46,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash -94816293, now seen corresponding path program 1 times [2025-01-09 10:52:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261668562] [2025-01-09 10:52:46,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 105 proven. 93 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-01-09 10:52:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261668562] [2025-01-09 10:52:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261668562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:52:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194124822] [2025-01-09 10:52:47,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:52:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:52:47,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:52:47,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:52:47,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:47,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:47,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:47,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:47,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 10:52:47,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1305 proven. 93 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2025-01-09 10:52:48,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:52:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 105 proven. 96 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-01-09 10:52:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194124822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:52:49,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:52:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2025-01-09 10:52:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436543295] [2025-01-09 10:52:49,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:52:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 10:52:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:49,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 10:52:49,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:52:49,101 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) [2025-01-09 10:52:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:50,425 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2025-01-09 10:52:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 10:52:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) Word has length 227 [2025-01-09 10:52:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:50,427 INFO L225 Difference]: With dead ends: 403 [2025-01-09 10:52:50,428 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 10:52:50,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 10:52:50,429 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 523 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:50,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1009 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:52:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 10:52:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 260. [2025-01-09 10:52:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 167 states have internal predecessors, (206), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 10:52:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 378 transitions. [2025-01-09 10:52:50,455 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 378 transitions. Word has length 227 [2025-01-09 10:52:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 378 transitions. [2025-01-09 10:52:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) [2025-01-09 10:52:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 378 transitions. [2025-01-09 10:52:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:50,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:50,458 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:50,465 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 10:52:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:52:50,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1068552793, now seen corresponding path program 1 times [2025-01-09 10:52:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713262399] [2025-01-09 10:52:50,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:50,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:50,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:50,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713262399] [2025-01-09 10:52:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713262399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:50,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:52:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400418156] [2025-01-09 10:52:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:50,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:52:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:50,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:52:50,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:52:50,805 INFO L87 Difference]: Start difference. First operand 260 states and 378 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:50,858 INFO L93 Difference]: Finished difference Result 680 states and 987 transitions. [2025-01-09 10:52:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:52:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-01-09 10:52:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:50,863 INFO L225 Difference]: With dead ends: 680 [2025-01-09 10:52:50,863 INFO L226 Difference]: Without dead ends: 453 [2025-01-09 10:52:50,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:52:50,864 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 127 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:50,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 664 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:52:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-09 10:52:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 286. [2025-01-09 10:52:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 191 states have (on average 1.287958115183246) internal successors, (246), 193 states have internal predecessors, (246), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 10:52:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2025-01-09 10:52:50,894 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 227 [2025-01-09 10:52:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2025-01-09 10:52:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2025-01-09 10:52:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:50,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:50,896 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:50,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:52:50,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -211310885, now seen corresponding path program 1 times [2025-01-09 10:52:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900190385] [2025-01-09 10:52:50,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:50,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:50,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:50,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:52:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900190385] [2025-01-09 10:52:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900190385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:52:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856409624] [2025-01-09 10:52:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:52:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:52:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:52:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:52:51,039 INFO L87 Difference]: Start difference. First operand 286 states and 418 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:51,180 INFO L93 Difference]: Finished difference Result 539 states and 788 transitions. [2025-01-09 10:52:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:52:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2025-01-09 10:52:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:51,183 INFO L225 Difference]: With dead ends: 539 [2025-01-09 10:52:51,184 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 10:52:51,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:52:51,185 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 149 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 215 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:52:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 10:52:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-01-09 10:52:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 193 states have internal predecessors, (244), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 10:52:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2025-01-09 10:52:51,219 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 227 [2025-01-09 10:52:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:51,220 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2025-01-09 10:52:51,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:52:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2025-01-09 10:52:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 10:52:51,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:51,223 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:52:51,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1900254627, now seen corresponding path program 1 times [2025-01-09 10:52:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:52:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412243654] [2025-01-09 10:52:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:52:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:51,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:51,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:51,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 123 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-01-09 10:52:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:52:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412243654] [2025-01-09 10:52:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412243654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:52:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724264314] [2025-01-09 10:52:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:52:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:52:52,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:52:52,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:52:52,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 10:52:52,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 10:52:52,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:52,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:52,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 10:52:52,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1511 proven. 237 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-01-09 10:53:08,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:53:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 135 proven. 255 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2025-01-09 10:53:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724264314] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:53:14,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:53:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 19] total 44 [2025-01-09 10:53:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730866705] [2025-01-09 10:53:14,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:53:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 10:53:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 10:53:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1472, Unknown=2, NotChecked=0, Total=1892 [2025-01-09 10:53:14,524 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand has 44 states, 42 states have (on average 3.5476190476190474) internal successors, (149), 42 states have internal predecessors, (149), 12 states have call successors, (90), 5 states have call predecessors, (90), 12 states have return successors, (91), 11 states have call predecessors, (91), 12 states have call successors, (91) [2025-01-09 10:53:22,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:26,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:35,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:42,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:51,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:55,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:54:10,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 10:54:14,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 10:54:18,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]