./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.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 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:20:18,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:20:18,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:20:18,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:20:18,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:20:18,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:20:18,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:20:18,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:20:18,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:20:18,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:20:18,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:20:18,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:20:18,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:20:18,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:20:18,682 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:20:18,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:20:18,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:20:18,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:18,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:20:18,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:18,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:20:18,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:20:18,685 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 -> 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 [2025-01-09 09:20:18,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:20:18,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:20:18,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:20:18,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:20:18,870 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:20:18,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-01-09 09:20:20,018 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01954d078/09c8975c984d4a55a5c3f29e022933ce/FLAGb6f4422c6 [2025-01-09 09:20:20,302 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:20:20,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-01-09 09:20:20,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01954d078/09c8975c984d4a55a5c3f29e022933ce/FLAGb6f4422c6 [2025-01-09 09:20:20,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01954d078/09c8975c984d4a55a5c3f29e022933ce [2025-01-09 09:20:20,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:20:20,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:20:20,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:20:20,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:20:20,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:20:20,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddb531b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20, skipping insertion in model container [2025-01-09 09:20:20,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:20:20,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i[916,929] [2025-01-09 09:20:20,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:20:20,853 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:20:20,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i[916,929] [2025-01-09 09:20:20,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:20:20,905 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:20:20,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20 WrapperNode [2025-01-09 09:20:20,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:20:20,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:20:20,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:20:20,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:20:20,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,950 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 311 [2025-01-09 09:20:20,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:20:20,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:20:20,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:20:20,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:20:20,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,989 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:20:20,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:20,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:21,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:21,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:21,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:21,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:20:21,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:20:21,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:20:21,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:20:21,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (1/1) ... [2025-01-09 09:20:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:21,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:20:21,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:20:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:20:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:20:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:20:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:20:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:20:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:20:21,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:20:21,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:20:21,642 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 09:20:21,643 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:20:21,652 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:20:21,654 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:20:21,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:21 BoogieIcfgContainer [2025-01-09 09:20:21,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:20:21,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:20:21,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:20:21,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:20:21,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:20:20" (1/3) ... [2025-01-09 09:20:21,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1355ec97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:21, skipping insertion in model container [2025-01-09 09:20:21,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:20" (2/3) ... [2025-01-09 09:20:21,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1355ec97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:21, skipping insertion in model container [2025-01-09 09:20:21,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:21" (3/3) ... [2025-01-09 09:20:21,670 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-01-09 09:20:21,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:20:21,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:20:21,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:20:21,753 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;@27b57e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:20:21,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:20:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:20:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-09 09:20:21,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:21,774 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:21,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 219332865, now seen corresponding path program 1 times [2025-01-09 09:20:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:21,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051194325] [2025-01-09 09:20:21,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 09:20:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 09:20:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-01-09 09:20:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:22,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051194325] [2025-01-09 09:20:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051194325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:20:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968429170] [2025-01-09 09:20:22,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:22,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:22,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:20:22,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:20:22,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 09:20:22,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 09:20:22,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:22,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:22,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:20:22,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-01-09 09:20:22,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:20:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968429170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:22,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:20:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:20:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720619302] [2025-01-09 09:20:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:22,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:20:22,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:22,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:20:22,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:20:22,500 INFO L87 Difference]: Start difference. First operand has 134 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 09:20:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:22,526 INFO L93 Difference]: Finished difference Result 258 states and 466 transitions. [2025-01-09 09:20:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:20:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 286 [2025-01-09 09:20:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:22,535 INFO L225 Difference]: With dead ends: 258 [2025-01-09 09:20:22,535 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 09:20:22,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:20:22,545 INFO L435 NwaCegarLoop]: 202 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, 202 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:22,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 09:20:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 09:20:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:20:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 202 transitions. [2025-01-09 09:20:22,582 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 202 transitions. Word has length 286 [2025-01-09 09:20:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:22,582 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 202 transitions. [2025-01-09 09:20:22,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 09:20:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 202 transitions. [2025-01-09 09:20:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-09 09:20:22,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:22,587 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:22,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:20:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:20:22,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1266245371, now seen corresponding path program 1 times [2025-01-09 09:20:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783228254] [2025-01-09 09:20:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:22,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 09:20:22,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 09:20:22,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:22,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783228254] [2025-01-09 09:20:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783228254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:20:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544244881] [2025-01-09 09:20:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:20:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:23,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:20:23,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:20:23,244 INFO L87 Difference]: Start difference. First operand 127 states and 202 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:23,337 INFO L93 Difference]: Finished difference Result 326 states and 520 transitions. [2025-01-09 09:20:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:20:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 286 [2025-01-09 09:20:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:23,342 INFO L225 Difference]: With dead ends: 326 [2025-01-09 09:20:23,344 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 09:20:23,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:20:23,345 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 116 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:23,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 437 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 09:20:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-01-09 09:20:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 133 states have internal predecessors, (190), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 09:20:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2025-01-09 09:20:23,378 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 286 [2025-01-09 09:20:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2025-01-09 09:20:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2025-01-09 09:20:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 09:20:23,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:23,388 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:23,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:20:23,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:23,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2012840574, now seen corresponding path program 1 times [2025-01-09 09:20:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636823281] [2025-01-09 09:20:23,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:23,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 09:20:23,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 09:20:23,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636823281] [2025-01-09 09:20:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636823281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:20:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809945595] [2025-01-09 09:20:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:20:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:33,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:20:33,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:20:33,027 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 09:20:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:37,164 INFO L93 Difference]: Finished difference Result 786 states and 1217 transitions. [2025-01-09 09:20:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 09:20:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 287 [2025-01-09 09:20:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:37,179 INFO L225 Difference]: With dead ends: 786 [2025-01-09 09:20:37,179 INFO L226 Difference]: Without dead ends: 590 [2025-01-09 09:20:37,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=452, Invalid=1188, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 09:20:37,184 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 486 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:37,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1657 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:20:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-09 09:20:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 431. [2025-01-09 09:20:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 298 states have (on average 1.4161073825503356) internal successors, (422), 300 states have internal predecessors, (422), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 09:20:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 678 transitions. [2025-01-09 09:20:37,258 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 678 transitions. Word has length 287 [2025-01-09 09:20:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 678 transitions. [2025-01-09 09:20:37,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 09:20:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 678 transitions. [2025-01-09 09:20:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 09:20:37,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:37,263 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:20:37,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2023961284, now seen corresponding path program 1 times [2025-01-09 09:20:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349860956] [2025-01-09 09:20:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:37,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 09:20:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 09:20:37,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349860956] [2025-01-09 09:20:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349860956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:20:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223141988] [2025-01-09 09:20:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:20:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:20:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:20:37,493 INFO L87 Difference]: Start difference. First operand 431 states and 678 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:37,708 INFO L93 Difference]: Finished difference Result 1209 states and 1919 transitions. [2025-01-09 09:20:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:20:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-01-09 09:20:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:37,716 INFO L225 Difference]: With dead ends: 1209 [2025-01-09 09:20:37,716 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 09:20:37,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:20:37,719 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 218 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:37,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 837 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:20:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 09:20:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 437. [2025-01-09 09:20:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 304 states have (on average 1.4078947368421053) internal successors, (428), 306 states have internal predecessors, (428), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 09:20:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 684 transitions. [2025-01-09 09:20:37,785 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 684 transitions. Word has length 287 [2025-01-09 09:20:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:37,786 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 684 transitions. [2025-01-09 09:20:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 684 transitions. [2025-01-09 09:20:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 09:20:37,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:37,788 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:37,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:20:37,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 956443708, now seen corresponding path program 1 times [2025-01-09 09:20:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288886824] [2025-01-09 09:20:37,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:37,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 09:20:37,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 09:20:37,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:37,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288886824] [2025-01-09 09:20:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288886824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:38,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:38,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:20:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975124210] [2025-01-09 09:20:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:38,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:20:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:38,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:20:38,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:20:38,166 INFO L87 Difference]: Start difference. First operand 437 states and 684 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:38,266 INFO L93 Difference]: Finished difference Result 1013 states and 1552 transitions. [2025-01-09 09:20:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:20:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-01-09 09:20:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:38,270 INFO L225 Difference]: With dead ends: 1013 [2025-01-09 09:20:38,271 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 09:20:38,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:20:38,272 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 90 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:38,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 405 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:20:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 09:20:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 489. [2025-01-09 09:20:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 352 states have (on average 1.375) internal successors, (484), 354 states have internal predecessors, (484), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 09:20:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 740 transitions. [2025-01-09 09:20:38,307 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 740 transitions. Word has length 287 [2025-01-09 09:20:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:38,308 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 740 transitions. [2025-01-09 09:20:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 740 transitions. [2025-01-09 09:20:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 09:20:38,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:38,313 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:20:38,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 698278270, now seen corresponding path program 1 times [2025-01-09 09:20:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147106085] [2025-01-09 09:20:38,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 09:20:38,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 09:20:38,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:38,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:42,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147106085] [2025-01-09 09:20:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147106085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 09:20:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845365861] [2025-01-09 09:20:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:42,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:20:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:42,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:20:42,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:20:42,876 INFO L87 Difference]: Start difference. First operand 489 states and 740 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) [2025-01-09 09:20:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:43,723 INFO L93 Difference]: Finished difference Result 1279 states and 1912 transitions. [2025-01-09 09:20:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:20:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) Word has length 287 [2025-01-09 09:20:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:43,728 INFO L225 Difference]: With dead ends: 1279 [2025-01-09 09:20:43,729 INFO L226 Difference]: Without dead ends: 793 [2025-01-09 09:20:43,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:20:43,730 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 379 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:43,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1658 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:20:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-01-09 09:20:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 625. [2025-01-09 09:20:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 440 states have (on average 1.3909090909090909) internal successors, (612), 442 states have internal predecessors, (612), 174 states have call successors, (174), 10 states have call predecessors, (174), 10 states have return successors, (174), 172 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:20:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 960 transitions. [2025-01-09 09:20:43,805 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 960 transitions. Word has length 287 [2025-01-09 09:20:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 960 transitions. [2025-01-09 09:20:43,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) [2025-01-09 09:20:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 960 transitions. [2025-01-09 09:20:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 09:20:43,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:43,810 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:20:43,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:43,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash 732976896, now seen corresponding path program 1 times [2025-01-09 09:20:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165511851] [2025-01-09 09:20:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 09:20:43,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 09:20:43,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165511851] [2025-01-09 09:20:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165511851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:43,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:20:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68444044] [2025-01-09 09:20:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:43,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:20:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:43,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:20:43,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:20:43,901 INFO L87 Difference]: Start difference. First operand 625 states and 960 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:44,079 INFO L93 Difference]: Finished difference Result 845 states and 1299 transitions. [2025-01-09 09:20:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:20:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-01-09 09:20:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:44,083 INFO L225 Difference]: With dead ends: 845 [2025-01-09 09:20:44,083 INFO L226 Difference]: Without dead ends: 619 [2025-01-09 09:20:44,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:20:44,085 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 173 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 291 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:20:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-09 09:20:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2025-01-09 09:20:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 434 states have (on average 1.3732718894009217) internal successors, (596), 436 states have internal predecessors, (596), 174 states have call successors, (174), 10 states have call predecessors, (174), 10 states have return successors, (174), 172 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:20:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 944 transitions. [2025-01-09 09:20:44,126 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 944 transitions. Word has length 287 [2025-01-09 09:20:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 944 transitions. [2025-01-09 09:20:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 944 transitions. [2025-01-09 09:20:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 09:20:44,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:44,130 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:44,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:20:44,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:44,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -367870151, now seen corresponding path program 1 times [2025-01-09 09:20:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249994093] [2025-01-09 09:20:44,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:44,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 09:20:44,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 09:20:44,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:44,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:47,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249994093] [2025-01-09 09:20:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249994093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:47,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:20:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534043490] [2025-01-09 09:20:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:20:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:47,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:20:47,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:20:47,818 INFO L87 Difference]: Start difference. First operand 619 states and 944 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:49,577 INFO L93 Difference]: Finished difference Result 1207 states and 1804 transitions. [2025-01-09 09:20:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:20:49,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 288 [2025-01-09 09:20:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:49,582 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 09:20:49,583 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 09:20:49,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:20:49,585 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 297 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:49,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 950 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:20:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 09:20:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 635. [2025-01-09 09:20:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 450 states have (on average 1.3688888888888888) internal successors, (616), 452 states have internal predecessors, (616), 174 states have call successors, (174), 10 states have call predecessors, (174), 10 states have return successors, (174), 172 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:20:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 964 transitions. [2025-01-09 09:20:49,650 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 964 transitions. Word has length 288 [2025-01-09 09:20:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:49,651 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 964 transitions. [2025-01-09 09:20:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 964 transitions. [2025-01-09 09:20:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 09:20:49,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:49,653 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:20:49,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1243565371, now seen corresponding path program 1 times [2025-01-09 09:20:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340825784] [2025-01-09 09:20:49,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:49,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 09:20:49,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 09:20:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 09:20:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340825784] [2025-01-09 09:20:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340825784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:20:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461394728] [2025-01-09 09:20:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:51,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:20:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:51,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:20:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:20:51,288 INFO L87 Difference]: Start difference. First operand 635 states and 964 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-01-09 09:20:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:51,813 INFO L93 Difference]: Finished difference Result 1191 states and 1779 transitions. [2025-01-09 09:20:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:20:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 288 [2025-01-09 09:20:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:51,823 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 09:20:51,823 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 09:20:51,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:20:51,824 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 193 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:51,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1652 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:20:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 09:20:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 633. [2025-01-09 09:20:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 448 states have (on average 1.3660714285714286) internal successors, (612), 450 states have internal predecessors, (612), 174 states have call successors, (174), 10 states have call predecessors, (174), 10 states have return successors, (174), 172 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:20:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 960 transitions. [2025-01-09 09:20:51,867 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 960 transitions. Word has length 288 [2025-01-09 09:20:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 960 transitions. [2025-01-09 09:20:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-01-09 09:20:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 960 transitions. [2025-01-09 09:20:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 09:20:51,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:51,873 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:20:51,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1455577348, now seen corresponding path program 1 times [2025-01-09 09:20:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040710436] [2025-01-09 09:20:51,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:51,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 09:20:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 09:20:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16842 backedges. 86 proven. 12 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:20:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040710436] [2025-01-09 09:20:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040710436] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:20:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458038810] [2025-01-09 09:20:57,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:57,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:20:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:20:57,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 09:20:57,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 09:20:57,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:57,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:57,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 09:20:57,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16842 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16831 trivial. 0 not checked. [2025-01-09 09:20:57,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:20:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458038810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:20:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2025-01-09 09:20:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103274073] [2025-01-09 09:20:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:20:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:57,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:20:57,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:20:57,657 INFO L87 Difference]: Start difference. First operand 633 states and 960 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:57,690 INFO L93 Difference]: Finished difference Result 1065 states and 1611 transitions. [2025-01-09 09:20:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:20:57,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 571 [2025-01-09 09:20:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:57,694 INFO L225 Difference]: With dead ends: 1065 [2025-01-09 09:20:57,694 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 09:20:57,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:20:57,696 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:57,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 09:20:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 435. [2025-01-09 09:20:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 298 states have (on average 1.3221476510067114) internal successors, (394), 300 states have internal predecessors, (394), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 09:20:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 650 transitions. [2025-01-09 09:20:57,722 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 650 transitions. Word has length 571 [2025-01-09 09:20:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 650 transitions. [2025-01-09 09:20:57,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 09:20:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 650 transitions. [2025-01-09 09:20:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 09:20:57,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:57,726 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:20:57,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:20:57,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:57,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:57,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1748644141, now seen corresponding path program 1 times [2025-01-09 09:20:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103939657] [2025-01-09 09:20:57,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 09:20:58,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 09:20:58,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:58,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:21:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16843 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 09:21:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:21:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103939657] [2025-01-09 09:21:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103939657] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:21:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943014766] [2025-01-09 09:21:04,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:21:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:21:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:21:04,609 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 09:21:04,611 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 09:21:04,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 09:21:04,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 09:21:04,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:21:04,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:21:04,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 09:21:04,836 INFO L279 TraceCheckSpWp]: Computing forward predicates...