./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.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 4d8190b73b1c4bb4c40d32cc6dbe0fce4e7bf91cb328b437eab368a12fac4d3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:04:06,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:04:06,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:04:06,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:04:06,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:04:06,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:04:06,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:04:06,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:04:06,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:04:06,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:04:06,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:04:06,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:04:06,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:04:06,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:04:06,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:04:06,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:06,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:06,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:06,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:04:06,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:04:06,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:04:06,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:04:06,910 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 -> 4d8190b73b1c4bb4c40d32cc6dbe0fce4e7bf91cb328b437eab368a12fac4d3f [2025-01-09 10:04:07,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:04:07,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:04:07,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:04:07,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:04:07,085 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:04:07,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-01-09 10:04:08,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643ddd3e/50794d9ec66346b391a20228c4242ddd/FLAG561a11d0d [2025-01-09 10:04:08,716 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:04:08,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-01-09 10:04:08,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643ddd3e/50794d9ec66346b391a20228c4242ddd/FLAG561a11d0d [2025-01-09 10:04:08,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c643ddd3e/50794d9ec66346b391a20228c4242ddd [2025-01-09 10:04:08,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:04:08,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:04:08,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:08,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:04:08,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:04:08,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:08" (1/1) ... [2025-01-09 10:04:08,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:08, skipping insertion in model container [2025-01-09 10:04:08,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:08" (1/1) ... [2025-01-09 10:04:08,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:04:09,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i[916,929] [2025-01-09 10:04:09,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:09,218 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:04:09,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i[916,929] [2025-01-09 10:04:09,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:09,299 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:04:09,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09 WrapperNode [2025-01-09 10:04:09,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:09,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:09,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:04:09,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:04:09,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,467 INFO L138 Inliner]: procedures = 26, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 890 [2025-01-09 10:04:09,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:09,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:04:09,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:04:09,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:04:09,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,529 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:04:09,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:04:09,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:04:09,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:04:09,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:04:09,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 10:04:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:09,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:04:09,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:04:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:04:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:04:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:04:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:04:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:04:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:04:09,753 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:04:09,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:04:10,709 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 10:04:10,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:04:10,721 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:04:10,721 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:04:10,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:10 BoogieIcfgContainer [2025-01-09 10:04:10,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:04:10,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:04:10,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:04:10,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:04:10,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:08" (1/3) ... [2025-01-09 10:04:10,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd7f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:10, skipping insertion in model container [2025-01-09 10:04:10,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (2/3) ... [2025-01-09 10:04:10,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd7f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:10, skipping insertion in model container [2025-01-09 10:04:10,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:10" (3/3) ... [2025-01-09 10:04:10,728 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-01-09 10:04:10,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:04:10,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-32.i that has 2 procedures, 372 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:04:10,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:04:10,791 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;@7e9f14bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:04:10,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:04:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 248 states have internal predecessors, (389), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 10:04:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:10,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:10,820 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:10,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 137808629, now seen corresponding path program 1 times [2025-01-09 10:04:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449861750] [2025-01-09 10:04:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:10,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:10,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:10,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-01-09 10:04:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449861750] [2025-01-09 10:04:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449861750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:04:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297309990] [2025-01-09 10:04:11,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:11,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:04:11,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:11,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:04:11,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:04:11,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:11,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:11,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:11,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:11,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:04:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:04:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-01-09 10:04:11,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:04:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297309990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:04:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:04:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569551264] [2025-01-09 10:04:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:04:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:04:12,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:12,004 INFO L87 Difference]: Start difference. First operand has 372 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 248 states have internal predecessors, (389), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:04:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:12,050 INFO L93 Difference]: Finished difference Result 738 states and 1383 transitions. [2025-01-09 10:04:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:04:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-01-09 10:04:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:12,058 INFO L225 Difference]: With dead ends: 738 [2025-01-09 10:04:12,058 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 10:04:12,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:12,063 INFO L435 NwaCegarLoop]: 626 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, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:12,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 10:04:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-01-09 10:04:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 245 states have internal predecessors, (382), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 10:04:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 626 transitions. [2025-01-09 10:04:12,127 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 626 transitions. Word has length 765 [2025-01-09 10:04:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:12,127 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 626 transitions. [2025-01-09 10:04:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:04:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 626 transitions. [2025-01-09 10:04:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:12,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:12,141 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:12,150 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 10:04:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:04:12,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1663360901, now seen corresponding path program 1 times [2025-01-09 10:04:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391206373] [2025-01-09 10:04:12,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:12,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:12,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:12,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:12,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391206373] [2025-01-09 10:04:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391206373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:13,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510239595] [2025-01-09 10:04:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:13,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:13,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:13,413 INFO L87 Difference]: Start difference. First operand 369 states and 626 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:13,523 INFO L93 Difference]: Finished difference Result 1101 states and 1872 transitions. [2025-01-09 10:04:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-01-09 10:04:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:13,534 INFO L225 Difference]: With dead ends: 1101 [2025-01-09 10:04:13,541 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 10:04:13,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:13,544 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 353 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:13,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1238 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 10:04:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 732. [2025-01-09 10:04:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 485 states have (on average 1.5608247422680412) internal successors, (757), 485 states have internal predecessors, (757), 244 states have call successors, (244), 2 states have call predecessors, (244), 2 states have return successors, (244), 244 states have call predecessors, (244), 244 states have call successors, (244) [2025-01-09 10:04:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1245 transitions. [2025-01-09 10:04:13,747 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1245 transitions. Word has length 765 [2025-01-09 10:04:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:13,750 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1245 transitions. [2025-01-09 10:04:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1245 transitions. [2025-01-09 10:04:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:13,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:13,766 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:13,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:04:13,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:13,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash 111646461, now seen corresponding path program 1 times [2025-01-09 10:04:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163909068] [2025-01-09 10:04:13,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:13,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:13,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:13,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:14,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163909068] [2025-01-09 10:04:14,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163909068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:14,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:14,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206975947] [2025-01-09 10:04:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:14,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:14,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:14,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:14,272 INFO L87 Difference]: Start difference. First operand 732 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:14,329 INFO L93 Difference]: Finished difference Result 1463 states and 2491 transitions. [2025-01-09 10:04:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-01-09 10:04:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:14,335 INFO L225 Difference]: With dead ends: 1463 [2025-01-09 10:04:14,336 INFO L226 Difference]: Without dead ends: 734 [2025-01-09 10:04:14,337 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 10:04:14,338 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:14,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-01-09 10:04:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2025-01-09 10:04:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 487 states have (on average 1.5585215605749487) internal successors, (759), 487 states have internal predecessors, (759), 244 states have call successors, (244), 2 states have call predecessors, (244), 2 states have return successors, (244), 244 states have call predecessors, (244), 244 states have call successors, (244) [2025-01-09 10:04:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1247 transitions. [2025-01-09 10:04:14,435 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1247 transitions. Word has length 765 [2025-01-09 10:04:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:14,438 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1247 transitions. [2025-01-09 10:04:14,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1247 transitions. [2025-01-09 10:04:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:14,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:14,452 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:04:14,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:14,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -475159553, now seen corresponding path program 1 times [2025-01-09 10:04:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819465914] [2025-01-09 10:04:14,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:14,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819465914] [2025-01-09 10:04:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819465914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:04:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629561211] [2025-01-09 10:04:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:04:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:04:14,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:14,852 INFO L87 Difference]: Start difference. First operand 734 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:15,066 INFO L93 Difference]: Finished difference Result 1856 states and 3181 transitions. [2025-01-09 10:04:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:04:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-01-09 10:04:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:15,078 INFO L225 Difference]: With dead ends: 1856 [2025-01-09 10:04:15,079 INFO L226 Difference]: Without dead ends: 1125 [2025-01-09 10:04:15,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:15,084 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 342 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:15,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2400 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:04:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-09 10:04:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1121. [2025-01-09 10:04:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 834 states have (on average 1.6402877697841727) internal successors, (1368), 836 states have internal predecessors, (1368), 282 states have call successors, (282), 4 states have call predecessors, (282), 4 states have return successors, (282), 280 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-09 10:04:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1932 transitions. [2025-01-09 10:04:15,193 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1932 transitions. Word has length 765 [2025-01-09 10:04:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:15,194 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1932 transitions. [2025-01-09 10:04:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1932 transitions. [2025-01-09 10:04:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:15,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:15,203 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:04:15,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1897956513, now seen corresponding path program 1 times [2025-01-09 10:04:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574653197] [2025-01-09 10:04:15,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:15,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:15,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:15,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574653197] [2025-01-09 10:04:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574653197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:16,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:16,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:04:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251717037] [2025-01-09 10:04:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:04:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:16,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:04:16,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:04:16,249 INFO L87 Difference]: Start difference. First operand 1121 states and 1932 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:17,148 INFO L93 Difference]: Finished difference Result 6381 states and 11066 transitions. [2025-01-09 10:04:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:04:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-01-09 10:04:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:17,178 INFO L225 Difference]: With dead ends: 6381 [2025-01-09 10:04:17,178 INFO L226 Difference]: Without dead ends: 5263 [2025-01-09 10:04:17,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:04:17,185 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 2416 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:17,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 2686 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:04:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2025-01-09 10:04:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4209. [2025-01-09 10:04:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4209 states, 3352 states have (on average 1.6742243436754176) internal successors, (5612), 3364 states have internal predecessors, (5612), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-01-09 10:04:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4209 states to 4209 states and 7292 transitions. [2025-01-09 10:04:17,460 INFO L78 Accepts]: Start accepts. Automaton has 4209 states and 7292 transitions. Word has length 765 [2025-01-09 10:04:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:17,461 INFO L471 AbstractCegarLoop]: Abstraction has 4209 states and 7292 transitions. [2025-01-09 10:04:17,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4209 states and 7292 transitions. [2025-01-09 10:04:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:17,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:17,468 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:17,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:04:17,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:17,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1835916899, now seen corresponding path program 1 times [2025-01-09 10:04:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107062081] [2025-01-09 10:04:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:17,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107062081] [2025-01-09 10:04:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107062081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151436021] [2025-01-09 10:04:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:18,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:18,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:18,087 INFO L87 Difference]: Start difference. First operand 4209 states and 7292 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:18,234 INFO L93 Difference]: Finished difference Result 8439 states and 14629 transitions. [2025-01-09 10:04:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-01-09 10:04:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:18,256 INFO L225 Difference]: With dead ends: 8439 [2025-01-09 10:04:18,257 INFO L226 Difference]: Without dead ends: 4233 [2025-01-09 10:04:18,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:18,269 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:18,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2025-01-09 10:04:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4233. [2025-01-09 10:04:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4233 states, 3376 states have (on average 1.669431279620853) internal successors, (5636), 3388 states have internal predecessors, (5636), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-01-09 10:04:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 7316 transitions. [2025-01-09 10:04:18,538 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 7316 transitions. Word has length 765 [2025-01-09 10:04:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:18,539 INFO L471 AbstractCegarLoop]: Abstraction has 4233 states and 7316 transitions. [2025-01-09 10:04:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-01-09 10:04:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 7316 transitions. [2025-01-09 10:04:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:18,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:18,545 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:18,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:04:18,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1561657119, now seen corresponding path program 1 times [2025-01-09 10:04:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:18,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068094909] [2025-01-09 10:04:18,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:18,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:18,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068094909] [2025-01-09 10:04:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068094909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:20,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:04:20,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786361070] [2025-01-09 10:04:20,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:20,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:04:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:20,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:04:20,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:04:20,944 INFO L87 Difference]: Start difference. First operand 4233 states and 7316 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:04:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:27,713 INFO L93 Difference]: Finished difference Result 42142 states and 72342 transitions. [2025-01-09 10:04:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 10:04:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-01-09 10:04:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:27,876 INFO L225 Difference]: With dead ends: 42142 [2025-01-09 10:04:27,876 INFO L226 Difference]: Without dead ends: 37912 [2025-01-09 10:04:27,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:04:27,897 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 7222 mSDsluCounter, 5137 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 1744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7222 SdHoareTripleChecker+Valid, 5856 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1744 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:27,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7222 Valid, 5856 Invalid, 4227 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1744 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 10:04:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37912 states. [2025-01-09 10:04:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37912 to 22313. [2025-01-09 10:04:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22313 states, 18439 states have (on average 1.6848527577417431) internal successors, (31067), 18560 states have internal predecessors, (31067), 3713 states have call successors, (3713), 160 states have call predecessors, (3713), 160 states have return successors, (3713), 3592 states have call predecessors, (3713), 3713 states have call successors, (3713) [2025-01-09 10:04:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22313 states to 22313 states and 38493 transitions. [2025-01-09 10:04:29,712 INFO L78 Accepts]: Start accepts. Automaton has 22313 states and 38493 transitions. Word has length 765 [2025-01-09 10:04:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:29,713 INFO L471 AbstractCegarLoop]: Abstraction has 22313 states and 38493 transitions. [2025-01-09 10:04:29,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:04:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22313 states and 38493 transitions. [2025-01-09 10:04:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:04:29,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:29,729 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:29,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:04:29,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:29,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 189849821, now seen corresponding path program 1 times [2025-01-09 10:04:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:29,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26900111] [2025-01-09 10:04:29,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:29,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:04:29,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:04:29,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:29,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-01-09 10:04:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26900111] [2025-01-09 10:04:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26900111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:04:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499285698] [2025-01-09 10:04:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:34,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:04:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:34,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:04:34,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:04:34,837 INFO L87 Difference]: Start difference. First operand 22313 states and 38493 transitions. Second operand has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:05:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:03,097 INFO L93 Difference]: Finished difference Result 155874 states and 260911 transitions. [2025-01-09 10:05:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 10:05:03,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-01-09 10:05:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:03,910 INFO L225 Difference]: With dead ends: 155874 [2025-01-09 10:05:03,911 INFO L226 Difference]: Without dead ends: 133612 [2025-01-09 10:05:04,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=893, Invalid=3013, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 10:05:04,049 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 7860 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 6227 mSolverCounterSat, 2789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7860 SdHoareTripleChecker+Valid, 7076 SdHoareTripleChecker+Invalid, 9016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2789 IncrementalHoareTripleChecker+Valid, 6227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:04,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7860 Valid, 7076 Invalid, 9016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2789 Valid, 6227 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-01-09 10:05:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133612 states. [2025-01-09 10:05:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133612 to 62397. [2025-01-09 10:05:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62397 states, 49581 states have (on average 1.6466993404731651) internal successors, (81645), 50018 states have internal predecessors, (81645), 12217 states have call successors, (12217), 598 states have call predecessors, (12217), 598 states have return successors, (12217), 11780 states have call predecessors, (12217), 12217 states have call successors, (12217) [2025-01-09 10:05:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62397 states to 62397 states and 106079 transitions. [2025-01-09 10:05:13,897 INFO L78 Accepts]: Start accepts. Automaton has 62397 states and 106079 transitions. Word has length 765 [2025-01-09 10:05:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 62397 states and 106079 transitions. [2025-01-09 10:05:13,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-01-09 10:05:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 62397 states and 106079 transitions. [2025-01-09 10:05:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-09 10:05:13,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:13,989 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:05:13,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:05:13,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:13,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1576053215, now seen corresponding path program 1 times [2025-01-09 10:05:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840260720] [2025-01-09 10:05:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:05:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:05:15,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:15,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 42 proven. 321 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-01-09 10:05:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840260720] [2025-01-09 10:05:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840260720] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392118540] [2025-01-09 10:05:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:16,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:05:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:05:16,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-01-09 10:05:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-01-09 10:05:16,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:16,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:16,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1710 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 10:05:16,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 12991 proven. 246 refuted. 0 times theorem prover too weak. 16287 trivial. 0 not checked. [2025-01-09 10:05:18,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:05:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 117 proven. 246 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-01-09 10:05:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392118540] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:05:19,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:05:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 13 [2025-01-09 10:05:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168853260] [2025-01-09 10:05:19,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:05:19,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:05:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:19,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:05:19,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:05:19,716 INFO L87 Difference]: Start difference. First operand 62397 states and 106079 transitions. Second operand has 13 states, 13 states have (on average 35.46153846153846) internal successors, (461), 13 states have internal predecessors, (461), 6 states have call successors, (366), 3 states have call predecessors, (366), 6 states have return successors, (366), 6 states have call predecessors, (366), 6 states have call successors, (366)