./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-64.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-64.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 a25157c7fbfaaeb445ae25173072ac685508ae68c0f4a311ca47f4d853fae71f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:07:02,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:07:03,042 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:07:03,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:07:03,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:07:03,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:07:03,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:07:03,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:07:03,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:07:03,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:07:03,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:07:03,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:07:03,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:07:03,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:03,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:03,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:07:03,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:07:03,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:07:03,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:07:03,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:07:03,071 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 -> a25157c7fbfaaeb445ae25173072ac685508ae68c0f4a311ca47f4d853fae71f [2025-01-09 10:07:03,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:07:03,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:07:03,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:07:03,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:07:03,301 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:07:03,301 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-64.i [2025-01-09 10:07:04,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42f3ec2b0/9289c4b2abfe49e9a2534320103e9ffe/FLAG0165647ad [2025-01-09 10:07:04,694 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:07:04,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-64.i [2025-01-09 10:07:04,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42f3ec2b0/9289c4b2abfe49e9a2534320103e9ffe/FLAG0165647ad [2025-01-09 10:07:04,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42f3ec2b0/9289c4b2abfe49e9a2534320103e9ffe [2025-01-09 10:07:04,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:07:04,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:07:04,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:04,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:07:05,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:07:05,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:04" (1/1) ... [2025-01-09 10:07:05,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5ca1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05, skipping insertion in model container [2025-01-09 10:07:05,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:04" (1/1) ... [2025-01-09 10:07:05,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:07:05,132 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-64.i[916,929] [2025-01-09 10:07:05,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:05,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:07:05,311 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-64.i[916,929] [2025-01-09 10:07:05,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:05,396 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:07:05,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05 WrapperNode [2025-01-09 10:07:05,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:05,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:05,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:07:05,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:07:05,403 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:07:05" (1/1) ... [2025-01-09 10:07:05,422 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:07:05" (1/1) ... [2025-01-09 10:07:05,497 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 803 [2025-01-09 10:07:05,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:05,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:07:05,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:07:05,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:07:05,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,562 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:07:05,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:07:05,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:07:05,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:07:05,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:07:05,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (1/1) ... [2025-01-09 10:07:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:05,679 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:07:05,681 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:07:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:07:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:07:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:07:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:07:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:07:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:07:05,804 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:07:05,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:07:06,681 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 10:07:06,682 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:07:06,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:07:06,701 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:07:06,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:06 BoogieIcfgContainer [2025-01-09 10:07:06,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:07:06,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:07:06,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:07:06,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:07:06,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:04" (1/3) ... [2025-01-09 10:07:06,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b7dcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:06, skipping insertion in model container [2025-01-09 10:07:06,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:05" (2/3) ... [2025-01-09 10:07:06,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b7dcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:06, skipping insertion in model container [2025-01-09 10:07:06,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:06" (3/3) ... [2025-01-09 10:07:06,710 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-64.i [2025-01-09 10:07:06,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:07:06,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-64.i that has 2 procedures, 330 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:07:06,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:07:06,804 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;@1eb5d885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:07:06,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:07:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 224 states have (on average 1.59375) internal successors, (357), 225 states have internal predecessors, (357), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 10:07:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-01-09 10:07:06,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:06,840 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:06,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -445103586, now seen corresponding path program 1 times [2025-01-09 10:07:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893208455] [2025-01-09 10:07:06,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-01-09 10:07:07,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-01-09 10:07:07,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:07,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-01-09 10:07:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893208455] [2025-01-09 10:07:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893208455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:07:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718445240] [2025-01-09 10:07:07,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:07,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:07:07,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:07,424 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:07:07,426 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:07:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-01-09 10:07:07,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-01-09 10:07:07,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:07,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:07,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:07:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:07:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-01-09 10:07:07,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:07:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718445240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:07:07,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:07:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927335061] [2025-01-09 10:07:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:07,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:07:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:07:07,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:07:07,885 INFO L87 Difference]: Start difference. First operand has 330 states, 224 states have (on average 1.59375) internal successors, (357), 225 states have internal predecessors, (357), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:07:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:07,942 INFO L93 Difference]: Finished difference Result 654 states and 1224 transitions. [2025-01-09 10:07:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:07:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) Word has length 658 [2025-01-09 10:07:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:07,953 INFO L225 Difference]: With dead ends: 654 [2025-01-09 10:07:07,953 INFO L226 Difference]: Without dead ends: 327 [2025-01-09 10:07:07,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 659 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:07:07,962 INFO L435 NwaCegarLoop]: 556 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, 556 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:07:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-09 10:07:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-01-09 10:07:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 222 states have (on average 1.5765765765765767) internal successors, (350), 222 states have internal predecessors, (350), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 10:07:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 556 transitions. [2025-01-09 10:07:08,038 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 556 transitions. Word has length 658 [2025-01-09 10:07:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:08,040 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 556 transitions. [2025-01-09 10:07:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:07:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 556 transitions. [2025-01-09 10:07:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:08,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:08,055 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:07:08,256 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:07:08,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2038034017, now seen corresponding path program 1 times [2025-01-09 10:07:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709973725] [2025-01-09 10:07:08,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:08,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:08,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709973725] [2025-01-09 10:07:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709973725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663942924] [2025-01-09 10:07:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:08,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:08,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:08,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:08,788 INFO L87 Difference]: Start difference. First operand 327 states and 556 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:08,876 INFO L93 Difference]: Finished difference Result 888 states and 1513 transitions. [2025-01-09 10:07:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:08,885 INFO L225 Difference]: With dead ends: 888 [2025-01-09 10:07:08,886 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 10:07:08,887 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:07:08,888 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 399 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:08,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 10:07:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2025-01-09 10:07:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 398 states have (on average 1.592964824120603) internal successors, (634), 399 states have internal predecessors, (634), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 159 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 10:07:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 954 transitions. [2025-01-09 10:07:08,959 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 954 transitions. Word has length 661 [2025-01-09 10:07:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:08,961 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 954 transitions. [2025-01-09 10:07:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 954 transitions. [2025-01-09 10:07:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:08,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:08,975 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:07:08,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:08,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -819266011, now seen corresponding path program 1 times [2025-01-09 10:07:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657217327] [2025-01-09 10:07:08,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:09,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:09,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657217327] [2025-01-09 10:07:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657217327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:09,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467207745] [2025-01-09 10:07:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:09,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:09,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:09,424 INFO L87 Difference]: Start difference. First operand 561 states and 954 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:09,540 INFO L93 Difference]: Finished difference Result 1543 states and 2621 transitions. [2025-01-09 10:07:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:09,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:09,552 INFO L225 Difference]: With dead ends: 1543 [2025-01-09 10:07:09,552 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 10:07:09,553 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:07:09,554 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 376 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:09,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1291 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 10:07:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 982. [2025-01-09 10:07:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 685 states have (on average 1.5737226277372263) internal successors, (1078), 688 states have internal predecessors, (1078), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1662 transitions. [2025-01-09 10:07:09,635 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1662 transitions. Word has length 661 [2025-01-09 10:07:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:09,637 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1662 transitions. [2025-01-09 10:07:09,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1662 transitions. [2025-01-09 10:07:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:09,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:09,643 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:07:09,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1361163365, now seen corresponding path program 1 times [2025-01-09 10:07:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640476803] [2025-01-09 10:07:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:09,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:09,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640476803] [2025-01-09 10:07:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640476803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:10,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:10,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365140030] [2025-01-09 10:07:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:10,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:10,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:10,312 INFO L87 Difference]: Start difference. First operand 982 states and 1662 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:10,865 INFO L93 Difference]: Finished difference Result 3859 states and 6527 transitions. [2025-01-09 10:07:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:10,886 INFO L225 Difference]: With dead ends: 3859 [2025-01-09 10:07:10,886 INFO L226 Difference]: Without dead ends: 2880 [2025-01-09 10:07:10,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:10,892 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 1085 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:10,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2995 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2025-01-09 10:07:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 998. [2025-01-09 10:07:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 701 states have (on average 1.5720399429386591) internal successors, (1102), 704 states have internal predecessors, (1102), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1686 transitions. [2025-01-09 10:07:11,035 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1686 transitions. Word has length 661 [2025-01-09 10:07:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:11,036 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1686 transitions. [2025-01-09 10:07:11,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1686 transitions. [2025-01-09 10:07:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:11,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:11,043 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:07:11,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash 551816739, now seen corresponding path program 1 times [2025-01-09 10:07:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400719679] [2025-01-09 10:07:11,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:11,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:11,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:11,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:11,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400719679] [2025-01-09 10:07:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400719679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:11,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103609914] [2025-01-09 10:07:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:11,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:11,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:11,636 INFO L87 Difference]: Start difference. First operand 998 states and 1686 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:12,123 INFO L93 Difference]: Finished difference Result 3875 states and 6547 transitions. [2025-01-09 10:07:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:12,145 INFO L225 Difference]: With dead ends: 3875 [2025-01-09 10:07:12,145 INFO L226 Difference]: Without dead ends: 2880 [2025-01-09 10:07:12,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:12,151 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 1075 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:12,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 3027 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2025-01-09 10:07:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 998. [2025-01-09 10:07:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 701 states have (on average 1.5720399429386591) internal successors, (1102), 704 states have internal predecessors, (1102), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1686 transitions. [2025-01-09 10:07:12,304 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1686 transitions. Word has length 661 [2025-01-09 10:07:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:12,306 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1686 transitions. [2025-01-09 10:07:12,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1686 transitions. [2025-01-09 10:07:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:12,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:12,314 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:07:12,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1878316389, now seen corresponding path program 1 times [2025-01-09 10:07:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073520810] [2025-01-09 10:07:12,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:12,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:12,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073520810] [2025-01-09 10:07:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073520810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626259024] [2025-01-09 10:07:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:12,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:12,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:12,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:12,850 INFO L87 Difference]: Start difference. First operand 998 states and 1686 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:13,343 INFO L93 Difference]: Finished difference Result 2986 states and 5029 transitions. [2025-01-09 10:07:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:13,354 INFO L225 Difference]: With dead ends: 2986 [2025-01-09 10:07:13,354 INFO L226 Difference]: Without dead ends: 1991 [2025-01-09 10:07:13,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:13,357 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 566 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:13,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 3028 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:07:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-01-09 10:07:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 998. [2025-01-09 10:07:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 701 states have (on average 1.5720399429386591) internal successors, (1102), 704 states have internal predecessors, (1102), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1686 transitions. [2025-01-09 10:07:13,452 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1686 transitions. Word has length 661 [2025-01-09 10:07:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:13,464 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1686 transitions. [2025-01-09 10:07:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1686 transitions. [2025-01-09 10:07:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:07:13,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:13,470 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:07:13,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1068969763, now seen corresponding path program 1 times [2025-01-09 10:07:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539095154] [2025-01-09 10:07:13,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:07:13,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:07:13,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:13,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539095154] [2025-01-09 10:07:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539095154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:13,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:13,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111585041] [2025-01-09 10:07:13,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:13,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:13,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:13,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:13,882 INFO L87 Difference]: Start difference. First operand 998 states and 1686 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:14,275 INFO L93 Difference]: Finished difference Result 2986 states and 5025 transitions. [2025-01-09 10:07:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 661 [2025-01-09 10:07:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:14,288 INFO L225 Difference]: With dead ends: 2986 [2025-01-09 10:07:14,288 INFO L226 Difference]: Without dead ends: 1991 [2025-01-09 10:07:14,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:14,292 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 556 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:14,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 3615 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-01-09 10:07:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 982. [2025-01-09 10:07:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 685 states have (on average 1.5678832116788322) internal successors, (1074), 688 states have internal predecessors, (1074), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1658 transitions. [2025-01-09 10:07:14,379 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1658 transitions. Word has length 661 [2025-01-09 10:07:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1658 transitions. [2025-01-09 10:07:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1658 transitions. [2025-01-09 10:07:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:14,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:14,385 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:07:14,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1859506752, now seen corresponding path program 1 times [2025-01-09 10:07:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087334911] [2025-01-09 10:07:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:14,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:14,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:14,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:14,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087334911] [2025-01-09 10:07:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087334911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:14,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503089402] [2025-01-09 10:07:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:14,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:14,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:14,877 INFO L87 Difference]: Start difference. First operand 982 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:15,739 INFO L93 Difference]: Finished difference Result 2759 states and 4647 transitions. [2025-01-09 10:07:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:07:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:15,751 INFO L225 Difference]: With dead ends: 2759 [2025-01-09 10:07:15,752 INFO L226 Difference]: Without dead ends: 1780 [2025-01-09 10:07:15,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:15,756 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 776 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:15,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1028 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:07:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-01-09 10:07:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1206. [2025-01-09 10:07:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 908 states have (on average 1.6200440528634361) internal successors, (1471), 911 states have internal predecessors, (1471), 292 states have call successors, (292), 5 states have call predecessors, (292), 5 states have return successors, (292), 289 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:07:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2055 transitions. [2025-01-09 10:07:15,858 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2055 transitions. Word has length 663 [2025-01-09 10:07:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:15,859 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 2055 transitions. [2025-01-09 10:07:15,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2055 transitions. [2025-01-09 10:07:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:15,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:15,863 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:15,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:07:15,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1921546366, now seen corresponding path program 1 times [2025-01-09 10:07:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808499094] [2025-01-09 10:07:15,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:15,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:15,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:15,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808499094] [2025-01-09 10:07:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808499094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952240088] [2025-01-09 10:07:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:16,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:16,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:16,242 INFO L87 Difference]: Start difference. First operand 1206 states and 2055 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:16,346 INFO L93 Difference]: Finished difference Result 3184 states and 5422 transitions. [2025-01-09 10:07:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:16,356 INFO L225 Difference]: With dead ends: 3184 [2025-01-09 10:07:16,357 INFO L226 Difference]: Without dead ends: 1981 [2025-01-09 10:07:16,360 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:07:16,360 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 320 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:16,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-01-09 10:07:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1979. [2025-01-09 10:07:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1498 states have (on average 1.6174899866488652) internal successors, (2423), 1502 states have internal predecessors, (2423), 470 states have call successors, (470), 10 states have call predecessors, (470), 10 states have return successors, (470), 466 states have call predecessors, (470), 470 states have call successors, (470) [2025-01-09 10:07:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3363 transitions. [2025-01-09 10:07:16,519 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3363 transitions. Word has length 663 [2025-01-09 10:07:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:16,520 INFO L471 AbstractCegarLoop]: Abstraction has 1979 states and 3363 transitions. [2025-01-09 10:07:16,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3363 transitions. [2025-01-09 10:07:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:16,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:16,526 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:16,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:07:16,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 116108032, now seen corresponding path program 1 times [2025-01-09 10:07:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012227365] [2025-01-09 10:07:16,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:16,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:16,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:16,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012227365] [2025-01-09 10:07:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012227365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:07:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310032600] [2025-01-09 10:07:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:16,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:07:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:16,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:07:16,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:16,991 INFO L87 Difference]: Start difference. First operand 1979 states and 3363 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:17,773 INFO L93 Difference]: Finished difference Result 8744 states and 14862 transitions. [2025-01-09 10:07:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:07:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:17,810 INFO L225 Difference]: With dead ends: 8744 [2025-01-09 10:07:17,811 INFO L226 Difference]: Without dead ends: 6768 [2025-01-09 10:07:17,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:07:17,817 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 1112 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 3535 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2025-01-09 10:07:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 5367. [2025-01-09 10:07:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 4168 states have (on average 1.6307581573896353) internal successors, (6797), 4185 states have internal predecessors, (6797), 1173 states have call successors, (1173), 25 states have call predecessors, (1173), 25 states have return successors, (1173), 1156 states have call predecessors, (1173), 1173 states have call successors, (1173) [2025-01-09 10:07:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 9143 transitions. [2025-01-09 10:07:18,239 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 9143 transitions. Word has length 663 [2025-01-09 10:07:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 5367 states and 9143 transitions. [2025-01-09 10:07:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 9143 transitions. [2025-01-09 10:07:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:18,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:18,251 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:07:18,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:18,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2044380734, now seen corresponding path program 1 times [2025-01-09 10:07:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254875698] [2025-01-09 10:07:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:18,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254875698] [2025-01-09 10:07:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254875698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:18,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:07:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192847302] [2025-01-09 10:07:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:18,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:07:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:18,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:07:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:18,554 INFO L87 Difference]: Start difference. First operand 5367 states and 9143 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:19,867 INFO L93 Difference]: Finished difference Result 16389 states and 27682 transitions. [2025-01-09 10:07:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:07:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:19,907 INFO L225 Difference]: With dead ends: 16389 [2025-01-09 10:07:19,908 INFO L226 Difference]: Without dead ends: 11101 [2025-01-09 10:07:19,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:07:19,925 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 591 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:19,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 3159 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:07:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2025-01-09 10:07:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 7353. [2025-01-09 10:07:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7353 states, 5914 states have (on average 1.66452485627325) internal successors, (9844), 5936 states have internal predecessors, (9844), 1408 states have call successors, (1408), 30 states have call predecessors, (1408), 30 states have return successors, (1408), 1386 states have call predecessors, (1408), 1408 states have call successors, (1408) [2025-01-09 10:07:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7353 states to 7353 states and 12660 transitions. [2025-01-09 10:07:20,639 INFO L78 Accepts]: Start accepts. Automaton has 7353 states and 12660 transitions. Word has length 663 [2025-01-09 10:07:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 7353 states and 12660 transitions. [2025-01-09 10:07:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7353 states and 12660 transitions. [2025-01-09 10:07:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:20,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:20,649 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:20,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:07:20,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1650013948, now seen corresponding path program 1 times [2025-01-09 10:07:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50398949] [2025-01-09 10:07:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:20,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:20,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:20,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:20,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50398949] [2025-01-09 10:07:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50398949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891927191] [2025-01-09 10:07:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:21,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:21,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:21,217 INFO L87 Difference]: Start difference. First operand 7353 states and 12660 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:22,436 INFO L93 Difference]: Finished difference Result 27887 states and 48069 transitions. [2025-01-09 10:07:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:07:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:22,500 INFO L225 Difference]: With dead ends: 27887 [2025-01-09 10:07:22,500 INFO L226 Difference]: Without dead ends: 20537 [2025-01-09 10:07:22,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:22,518 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 610 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:22,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1512 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20537 states. [2025-01-09 10:07:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20537 to 20485. [2025-01-09 10:07:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 16720 states have (on average 1.6706937799043062) internal successors, (27934), 16788 states have internal predecessors, (27934), 3680 states have call successors, (3680), 84 states have call predecessors, (3680), 84 states have return successors, (3680), 3612 states have call predecessors, (3680), 3680 states have call successors, (3680) [2025-01-09 10:07:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 35294 transitions. [2025-01-09 10:07:24,108 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 35294 transitions. Word has length 663 [2025-01-09 10:07:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:24,109 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 35294 transitions. [2025-01-09 10:07:24,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 35294 transitions. [2025-01-09 10:07:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:24,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:24,198 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:24,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:07:24,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1168933690, now seen corresponding path program 1 times [2025-01-09 10:07:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073590863] [2025-01-09 10:07:24,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:24,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:24,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:24,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073590863] [2025-01-09 10:07:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073590863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:07:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763574768] [2025-01-09 10:07:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:07:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:24,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:07:24,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:07:24,983 INFO L87 Difference]: Start difference. First operand 20485 states and 35294 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:31,171 INFO L93 Difference]: Finished difference Result 89539 states and 152374 transitions. [2025-01-09 10:07:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:07:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:31,427 INFO L225 Difference]: With dead ends: 89539 [2025-01-09 10:07:31,427 INFO L226 Difference]: Without dead ends: 69057 [2025-01-09 10:07:31,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:07:31,483 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 1658 mSDsluCounter, 2741 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:31,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 3572 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 10:07:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69057 states. [2025-01-09 10:07:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69057 to 34455. [2025-01-09 10:07:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34455 states, 28702 states have (on average 1.6852484147446172) internal successors, (48370), 28802 states have internal predecessors, (48370), 5616 states have call successors, (5616), 136 states have call predecessors, (5616), 136 states have return successors, (5616), 5516 states have call predecessors, (5616), 5616 states have call successors, (5616) [2025-01-09 10:07:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34455 states to 34455 states and 59602 transitions. [2025-01-09 10:07:34,227 INFO L78 Accepts]: Start accepts. Automaton has 34455 states and 59602 transitions. Word has length 663 [2025-01-09 10:07:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:34,228 INFO L471 AbstractCegarLoop]: Abstraction has 34455 states and 59602 transitions. [2025-01-09 10:07:34,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34455 states and 59602 transitions. [2025-01-09 10:07:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:34,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:34,258 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:07:34,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash 967109756, now seen corresponding path program 1 times [2025-01-09 10:07:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959431545] [2025-01-09 10:07:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:34,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:34,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:34,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:34,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:34,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959431545] [2025-01-09 10:07:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959431545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:34,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366902038] [2025-01-09 10:07:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:34,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:34,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:34,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:34,568 INFO L87 Difference]: Start difference. First operand 34455 states and 59602 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:07:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:36,958 INFO L93 Difference]: Finished difference Result 62717 states and 108354 transitions. [2025-01-09 10:07:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) Word has length 663 [2025-01-09 10:07:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:37,089 INFO L225 Difference]: With dead ends: 62717 [2025-01-09 10:07:37,089 INFO L226 Difference]: Without dead ends: 42235 [2025-01-09 10:07:37,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:37,128 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 419 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:37,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1693 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42235 states. [2025-01-09 10:07:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42235 to 42233. [2025-01-09 10:07:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42233 states, 35346 states have (on average 1.6861879703502518) internal successors, (59600), 35461 states have internal predecessors, (59600), 6715 states have call successors, (6715), 171 states have call predecessors, (6715), 171 states have return successors, (6715), 6600 states have call predecessors, (6715), 6715 states have call successors, (6715) [2025-01-09 10:07:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42233 states to 42233 states and 73030 transitions. [2025-01-09 10:07:40,220 INFO L78 Accepts]: Start accepts. Automaton has 42233 states and 73030 transitions. Word has length 663 [2025-01-09 10:07:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:40,221 INFO L471 AbstractCegarLoop]: Abstraction has 42233 states and 73030 transitions. [2025-01-09 10:07:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:07:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42233 states and 73030 transitions. [2025-01-09 10:07:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:40,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:40,246 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:07:40,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:40,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2044480002, now seen corresponding path program 1 times [2025-01-09 10:07:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135963197] [2025-01-09 10:07:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:40,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135963197] [2025-01-09 10:07:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135963197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:41,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122382518] [2025-01-09 10:07:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:41,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:41,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:41,064 INFO L87 Difference]: Start difference. First operand 42233 states and 73030 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:46,150 INFO L93 Difference]: Finished difference Result 122199 states and 211321 transitions. [2025-01-09 10:07:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:07:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:07:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:46,357 INFO L225 Difference]: With dead ends: 122199 [2025-01-09 10:07:46,357 INFO L226 Difference]: Without dead ends: 80097 [2025-01-09 10:07:46,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:46,425 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 644 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:46,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1964 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:07:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80097 states. [2025-01-09 10:07:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80097 to 80017. [2025-01-09 10:07:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80017 states, 66346 states have (on average 1.6778404123835648) internal successors, (111318), 66587 states have internal predecessors, (111318), 13323 states have call successors, (13323), 347 states have call predecessors, (13323), 347 states have return successors, (13323), 13082 states have call predecessors, (13323), 13323 states have call successors, (13323) [2025-01-09 10:07:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80017 states to 80017 states and 137964 transitions. [2025-01-09 10:07:51,942 INFO L78 Accepts]: Start accepts. Automaton has 80017 states and 137964 transitions. Word has length 663 [2025-01-09 10:07:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:51,942 INFO L471 AbstractCegarLoop]: Abstraction has 80017 states and 137964 transitions. [2025-01-09 10:07:51,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:07:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 80017 states and 137964 transitions. [2025-01-09 10:07:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:07:51,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:51,988 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:07:51,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1226831552, now seen corresponding path program 1 times [2025-01-09 10:07:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742981531] [2025-01-09 10:07:51,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:52,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:07:52,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:07:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:07:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742981531] [2025-01-09 10:07:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742981531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:07:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670057969] [2025-01-09 10:07:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:07:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:52,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:07:52,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:07:52,917 INFO L87 Difference]: Start difference. First operand 80017 states and 137964 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:08:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:12,538 INFO L93 Difference]: Finished difference Result 320957 states and 554046 transitions. [2025-01-09 10:08:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:08:12,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 663 [2025-01-09 10:08:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:13,319 INFO L225 Difference]: With dead ends: 320957 [2025-01-09 10:08:13,319 INFO L226 Difference]: Without dead ends: 241071 [2025-01-09 10:08:13,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:08:13,496 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1378 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 3779 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:13,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 3779 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:08:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241071 states.