./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.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 19ddd5d3e870010456648368aac7f13027e543c029bb47d44edea54e5df0ea2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:02:58,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:02:58,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:02:58,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:02:58,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:02:58,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:02:58,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:02:58,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:02:58,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:02:58,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:02:58,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:02:58,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:02:58,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:02:58,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:02:58,220 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:02:58,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:02:58,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:02:58,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:02:58,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:02:58,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:02:58,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:02:58,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:02:58,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:02:58,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:02:58,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:02:58,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:02:58,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:02:58,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:02:58,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:02:58,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:58,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:58,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:58,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:58,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:02:58,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:02:58,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:02:58,226 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 -> 19ddd5d3e870010456648368aac7f13027e543c029bb47d44edea54e5df0ea2e [2025-01-09 11:02:58,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:02:58,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:02:58,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:02:58,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:02:58,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:02:58,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i [2025-01-09 11:02:59,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca310e07/ff95b9036c6d4a578eb4b684c5d7d261/FLAGb338493e4 [2025-01-09 11:03:00,153 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:03:00,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i [2025-01-09 11:03:00,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca310e07/ff95b9036c6d4a578eb4b684c5d7d261/FLAGb338493e4 [2025-01-09 11:03:00,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca310e07/ff95b9036c6d4a578eb4b684c5d7d261 [2025-01-09 11:03:00,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:03:00,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:03:00,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:03:00,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:03:00,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:03:00,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00, skipping insertion in model container [2025-01-09 11:03:00,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:03:00,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i[919,932] [2025-01-09 11:03:00,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:03:00,441 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:03:00,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i[919,932] [2025-01-09 11:03:00,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:03:00,494 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:03:00,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00 WrapperNode [2025-01-09 11:03:00,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:03:00,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:03:00,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:03:00,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:03:00,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,547 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-01-09 11:03:00,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:03:00,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:03:00,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:03:00,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:03:00,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,591 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 11:03:00,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:03:00,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:03:00,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:03:00,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:03:00,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (1/1) ... [2025-01-09 11:03:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:03:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:03:00,654 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 11:03:00,659 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 11:03:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:03:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:03:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:03:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:03:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:03:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:03:00,766 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:03:00,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:03:01,322 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 11:03:01,322 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:03:01,336 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:03:01,337 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:03:01,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:03:01 BoogieIcfgContainer [2025-01-09 11:03:01,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:03:01,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:03:01,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:03:01,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:03:01,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:03:00" (1/3) ... [2025-01-09 11:03:01,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eff291d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:03:01, skipping insertion in model container [2025-01-09 11:03:01,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:03:00" (2/3) ... [2025-01-09 11:03:01,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eff291d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:03:01, skipping insertion in model container [2025-01-09 11:03:01,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:03:01" (3/3) ... [2025-01-09 11:03:01,349 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i [2025-01-09 11:03:01,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:03:01,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:03:01,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:03:01,437 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;@7b2cccb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:03:01,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:03:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:03:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:03:01,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:01,456 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:01,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1356440582, now seen corresponding path program 1 times [2025-01-09 11:03:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:01,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322279860] [2025-01-09 11:03:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:01,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:03:01,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:03:01,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:01,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 11:03:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322279860] [2025-01-09 11:03:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322279860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:03:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742078196] [2025-01-09 11:03:01,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:01,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:03:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:03:01,813 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 11:03:01,815 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 11:03:01,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:03:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:03:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:02,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:03:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:03:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 11:03:02,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:03:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742078196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:02,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:03:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:03:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886870980] [2025-01-09 11:03:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:02,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:03:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:03:02,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:03:02,094 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:03:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:02,124 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-01-09 11:03:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:03:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-01-09 11:03:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:02,133 INFO L225 Difference]: With dead ends: 178 [2025-01-09 11:03:02,134 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 11:03:02,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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 11:03:02,143 INFO L435 NwaCegarLoop]: 138 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, 138 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 11:03:02,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:03:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 11:03:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 11:03:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:03:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-01-09 11:03:02,191 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 141 [2025-01-09 11:03:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:02,191 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-01-09 11:03:02,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:03:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-01-09 11:03:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 11:03:02,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:02,196 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:02,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:03:02,400 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 11:03:02,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:02,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1396204350, now seen corresponding path program 1 times [2025-01-09 11:03:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467976053] [2025-01-09 11:03:02,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:02,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 11:03:02,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 11:03:02,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:02,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467976053] [2025-01-09 11:03:02,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467976053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:02,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:02,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:03:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546409050] [2025-01-09 11:03:02,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:03:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:02,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:03:02,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:03:02,945 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:03,143 INFO L93 Difference]: Finished difference Result 301 states and 471 transitions. [2025-01-09 11:03:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:03:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-01-09 11:03:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:03,149 INFO L225 Difference]: With dead ends: 301 [2025-01-09 11:03:03,149 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 11:03:03,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 11:03:03,151 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:03,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 450 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:03:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 11:03:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 183. [2025-01-09 11:03:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 11:03:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 288 transitions. [2025-01-09 11:03:03,199 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 288 transitions. Word has length 141 [2025-01-09 11:03:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 288 transitions. [2025-01-09 11:03:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 288 transitions. [2025-01-09 11:03:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 11:03:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:03,205 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:03,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:03:03,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1814251823, now seen corresponding path program 1 times [2025-01-09 11:03:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359276600] [2025-01-09 11:03:03,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:03,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 11:03:03,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 11:03:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:03,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359276600] [2025-01-09 11:03:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359276600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:03:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320564725] [2025-01-09 11:03:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:03:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:03,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:03:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:03:03,545 INFO L87 Difference]: Start difference. First operand 183 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:03,843 INFO L93 Difference]: Finished difference Result 534 states and 841 transitions. [2025-01-09 11:03:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:03:03,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-01-09 11:03:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:03,847 INFO L225 Difference]: With dead ends: 534 [2025-01-09 11:03:03,847 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 11:03:03,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:03:03,850 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 176 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:03,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 483 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:03:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 11:03:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 187. [2025-01-09 11:03:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 144 states have internal predecessors, (212), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 11:03:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2025-01-09 11:03:03,892 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 142 [2025-01-09 11:03:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:03,892 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2025-01-09 11:03:03,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2025-01-09 11:03:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:03,898 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:03:03,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -317543321, now seen corresponding path program 1 times [2025-01-09 11:03:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-01-09 11:03:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:03,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:04,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:04,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:04,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-01-09 11:03:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056318053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:03:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192781159] [2025-01-09 11:03:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:08,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:03:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:03:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:03:08,987 INFO L87 Difference]: Start difference. First operand 187 states and 292 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:11,937 INFO L93 Difference]: Finished difference Result 575 states and 863 transitions. [2025-01-09 11:03:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:03:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:11,943 INFO L225 Difference]: With dead ends: 575 [2025-01-09 11:03:11,944 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 11:03:11,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:03:11,946 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 816 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:11,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 449 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:03:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 11:03:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 255. [2025-01-09 11:03:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 200 states have (on average 1.44) internal successors, (288), 202 states have internal predecessors, (288), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 11:03:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2025-01-09 11:03:11,996 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 388 transitions. Word has length 143 [2025-01-09 11:03:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:11,998 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 388 transitions. [2025-01-09 11:03:11,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 388 transitions. [2025-01-09 11:03:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:12,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:12,002 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:03:12,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1457464041, now seen corresponding path program 1 times [2025-01-09 11:03:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170105112] [2025-01-09 11:03:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:12,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:12,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:12,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:14,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:14,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170105112] [2025-01-09 11:03:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170105112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:03:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496863384] [2025-01-09 11:03:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:14,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:03:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:14,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:03:14,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:03:14,411 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:15,559 INFO L93 Difference]: Finished difference Result 923 states and 1395 transitions. [2025-01-09 11:03:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:03:15,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:15,566 INFO L225 Difference]: With dead ends: 923 [2025-01-09 11:03:15,566 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 11:03:15,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:03:15,568 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 484 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:15,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 479 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:03:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 11:03:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 379. [2025-01-09 11:03:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 303 states have (on average 1.4422442244224423) internal successors, (437), 305 states have internal predecessors, (437), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 11:03:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 577 transitions. [2025-01-09 11:03:15,620 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 577 transitions. Word has length 143 [2025-01-09 11:03:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:15,623 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 577 transitions. [2025-01-09 11:03:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 577 transitions. [2025-01-09 11:03:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:15,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:15,626 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:03:15,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:15,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash 362515049, now seen corresponding path program 1 times [2025-01-09 11:03:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026551615] [2025-01-09 11:03:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:15,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:15,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:15,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:15,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026551615] [2025-01-09 11:03:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026551615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:03:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422034004] [2025-01-09 11:03:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:17,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:03:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:17,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:03:17,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:03:17,915 INFO L87 Difference]: Start difference. First operand 379 states and 577 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:18,853 INFO L93 Difference]: Finished difference Result 1015 states and 1518 transitions. [2025-01-09 11:03:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:03:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:18,858 INFO L225 Difference]: With dead ends: 1015 [2025-01-09 11:03:18,858 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 11:03:18,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:03:18,862 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 420 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:18,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 483 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:03:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 11:03:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 560. [2025-01-09 11:03:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 484 states have (on average 1.462809917355372) internal successors, (708), 486 states have internal predecessors, (708), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 11:03:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 848 transitions. [2025-01-09 11:03:18,915 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 848 transitions. Word has length 143 [2025-01-09 11:03:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:18,915 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 848 transitions. [2025-01-09 11:03:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 848 transitions. [2025-01-09 11:03:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:18,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:18,917 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:03:18,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:18,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1587676392, now seen corresponding path program 1 times [2025-01-09 11:03:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:18,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675143674] [2025-01-09 11:03:18,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:18,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:18,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:18,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675143674] [2025-01-09 11:03:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675143674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:20,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:03:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651352653] [2025-01-09 11:03:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:20,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:03:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:20,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:03:20,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:03:20,250 INFO L87 Difference]: Start difference. First operand 560 states and 848 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:20,647 INFO L93 Difference]: Finished difference Result 1038 states and 1551 transitions. [2025-01-09 11:03:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:03:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:20,651 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 11:03:20,651 INFO L226 Difference]: Without dead ends: 740 [2025-01-09 11:03:20,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:03:20,653 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 205 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:20,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 413 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:03:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-01-09 11:03:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 570. [2025-01-09 11:03:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 494 states have (on average 1.4534412955465588) internal successors, (718), 496 states have internal predecessors, (718), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 11:03:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 858 transitions. [2025-01-09 11:03:20,698 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 858 transitions. Word has length 143 [2025-01-09 11:03:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:20,698 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 858 transitions. [2025-01-09 11:03:20,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 858 transitions. [2025-01-09 11:03:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:20,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:20,704 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:20,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:03:20,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:20,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 436395687, now seen corresponding path program 1 times [2025-01-09 11:03:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:20,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413644815] [2025-01-09 11:03:20,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:20,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:20,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:20,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:20,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413644815] [2025-01-09 11:03:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413644815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:03:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396050286] [2025-01-09 11:03:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:21,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:03:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:21,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:03:21,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:03:21,133 INFO L87 Difference]: Start difference. First operand 570 states and 858 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:21,814 INFO L93 Difference]: Finished difference Result 1130 states and 1680 transitions. [2025-01-09 11:03:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:03:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:21,821 INFO L225 Difference]: With dead ends: 1130 [2025-01-09 11:03:21,822 INFO L226 Difference]: Without dead ends: 846 [2025-01-09 11:03:21,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:03:21,823 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 345 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:21,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 507 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:03:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-01-09 11:03:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 572. [2025-01-09 11:03:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 496 states have (on average 1.4516129032258065) internal successors, (720), 498 states have internal predecessors, (720), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 11:03:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 860 transitions. [2025-01-09 11:03:21,867 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 860 transitions. Word has length 143 [2025-01-09 11:03:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 860 transitions. [2025-01-09 11:03:21,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 860 transitions. [2025-01-09 11:03:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 11:03:21,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:21,870 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:21,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:03:21,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -658553305, now seen corresponding path program 1 times [2025-01-09 11:03:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722371900] [2025-01-09 11:03:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:21,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 11:03:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 11:03:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722371900] [2025-01-09 11:03:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722371900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:03:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120501254] [2025-01-09 11:03:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:03:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:03:22,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:03:22,166 INFO L87 Difference]: Start difference. First operand 572 states and 860 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:22,411 INFO L93 Difference]: Finished difference Result 974 states and 1450 transitions. [2025-01-09 11:03:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:03:22,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 11:03:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:22,416 INFO L225 Difference]: With dead ends: 974 [2025-01-09 11:03:22,416 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 11:03:22,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 11:03:22,418 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 98 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:22,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 334 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:03:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 11:03:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 520. [2025-01-09 11:03:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 444 states have (on average 1.427927927927928) internal successors, (634), 446 states have internal predecessors, (634), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 11:03:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 774 transitions. [2025-01-09 11:03:22,470 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 774 transitions. Word has length 143 [2025-01-09 11:03:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:22,470 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 774 transitions. [2025-01-09 11:03:22,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 774 transitions. [2025-01-09 11:03:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 11:03:22,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:22,473 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:22,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:03:22,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:22,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1984454106, now seen corresponding path program 1 times [2025-01-09 11:03:22,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:22,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340700891] [2025-01-09 11:03:22,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:22,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 11:03:22,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 11:03:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340700891] [2025-01-09 11:03:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340700891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:03:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039822681] [2025-01-09 11:03:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:24,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:03:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:03:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:03:24,917 INFO L87 Difference]: Start difference. First operand 520 states and 774 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:26,910 INFO L93 Difference]: Finished difference Result 982 states and 1447 transitions. [2025-01-09 11:03:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:03:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 11:03:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:26,916 INFO L225 Difference]: With dead ends: 982 [2025-01-09 11:03:26,916 INFO L226 Difference]: Without dead ends: 730 [2025-01-09 11:03:26,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:03:26,918 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 258 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:26,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 636 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:03:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-01-09 11:03:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 450. [2025-01-09 11:03:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 384 states have (on average 1.4322916666666667) internal successors, (550), 384 states have internal predecessors, (550), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:03:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2025-01-09 11:03:26,969 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 144 [2025-01-09 11:03:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:26,970 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2025-01-09 11:03:26,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2025-01-09 11:03:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 11:03:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:26,972 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:26,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:03:26,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1614201971, now seen corresponding path program 1 times [2025-01-09 11:03:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302996805] [2025-01-09 11:03:26,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:26,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 11:03:27,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 11:03:27,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302996805] [2025-01-09 11:03:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302996805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:03:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892278538] [2025-01-09 11:03:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:36,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:03:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:36,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:03:36,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:03:36,279 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:38,688 INFO L93 Difference]: Finished difference Result 980 states and 1423 transitions. [2025-01-09 11:03:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:03:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 11:03:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:38,692 INFO L225 Difference]: With dead ends: 980 [2025-01-09 11:03:38,693 INFO L226 Difference]: Without dead ends: 639 [2025-01-09 11:03:38,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:03:38,695 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 359 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:38,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 791 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:03:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-01-09 11:03:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 521. [2025-01-09 11:03:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 455 states have (on average 1.408791208791209) internal successors, (641), 455 states have internal predecessors, (641), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:03:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 761 transitions. [2025-01-09 11:03:38,733 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 761 transitions. Word has length 144 [2025-01-09 11:03:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:38,733 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 761 transitions. [2025-01-09 11:03:38,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 761 transitions. [2025-01-09 11:03:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 11:03:38,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:38,736 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:38,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:03:38,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:38,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1298846798, now seen corresponding path program 1 times [2025-01-09 11:03:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:38,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084738738] [2025-01-09 11:03:38,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:38,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 11:03:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 11:03:38,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084738738] [2025-01-09 11:03:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084738738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:03:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753678918] [2025-01-09 11:03:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:03:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:03:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:03:45,411 INFO L87 Difference]: Start difference. First operand 521 states and 761 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:47,220 INFO L93 Difference]: Finished difference Result 817 states and 1180 transitions. [2025-01-09 11:03:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:03:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-01-09 11:03:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:47,224 INFO L225 Difference]: With dead ends: 817 [2025-01-09 11:03:47,224 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 11:03:47,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:03:47,226 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 441 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:47,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 691 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:03:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 11:03:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 511. [2025-01-09 11:03:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 445 states have (on average 1.4134831460674158) internal successors, (629), 445 states have internal predecessors, (629), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:03:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 749 transitions. [2025-01-09 11:03:47,264 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 749 transitions. Word has length 145 [2025-01-09 11:03:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 749 transitions. [2025-01-09 11:03:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 749 transitions. [2025-01-09 11:03:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 11:03:47,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:47,268 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:47,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:03:47,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1216903596, now seen corresponding path program 1 times [2025-01-09 11:03:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280059188] [2025-01-09 11:03:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 11:03:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 11:03:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:03:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:03:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:03:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280059188] [2025-01-09 11:03:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280059188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:03:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:03:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:03:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802167542] [2025-01-09 11:03:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:03:51,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:03:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:03:51,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:03:51,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:03:51,086 INFO L87 Difference]: Start difference. First operand 511 states and 749 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:03:57,232 INFO L93 Difference]: Finished difference Result 976 states and 1419 transitions. [2025-01-09 11:03:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:03:57,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-01-09 11:03:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:03:57,237 INFO L225 Difference]: With dead ends: 976 [2025-01-09 11:03:57,237 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 11:03:57,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:03:57,239 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 358 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:03:57,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 622 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 11:03:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 11:03:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 537. [2025-01-09 11:03:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 471 states have (on average 1.4118895966029723) internal successors, (665), 471 states have internal predecessors, (665), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:03:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 785 transitions. [2025-01-09 11:03:57,282 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 785 transitions. Word has length 145 [2025-01-09 11:03:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:03:57,282 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 785 transitions. [2025-01-09 11:03:57,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:03:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 785 transitions. [2025-01-09 11:03:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 11:03:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:03:57,288 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:57,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:03:57,288 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:03:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:03:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 121954604, now seen corresponding path program 1 times [2025-01-09 11:03:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:03:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605908788] [2025-01-09 11:03:57,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:03:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:03:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 11:03:57,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 11:03:57,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:03:57,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:04:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605908788] [2025-01-09 11:04:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605908788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:04:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325038116] [2025-01-09 11:04:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:00,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:04:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:00,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:04:00,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:04:00,357 INFO L87 Difference]: Start difference. First operand 537 states and 785 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:04:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:03,784 INFO L93 Difference]: Finished difference Result 1242 states and 1794 transitions. [2025-01-09 11:04:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:04:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2025-01-09 11:04:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:03,788 INFO L225 Difference]: With dead ends: 1242 [2025-01-09 11:04:03,789 INFO L226 Difference]: Without dead ends: 915 [2025-01-09 11:04:03,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:04:03,791 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 763 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:03,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 848 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 11:04:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-09 11:04:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 639. [2025-01-09 11:04:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 573 states have (on average 1.4153577661431065) internal successors, (811), 573 states have internal predecessors, (811), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:04:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 931 transitions. [2025-01-09 11:04:03,853 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 931 transitions. Word has length 145 [2025-01-09 11:04:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:03,854 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 931 transitions. [2025-01-09 11:04:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:04:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 931 transitions. [2025-01-09 11:04:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 11:04:03,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:03,857 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:04:03,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1896961966, now seen corresponding path program 1 times [2025-01-09 11:04:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774859818] [2025-01-09 11:04:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 11:04:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 11:04:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:04:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774859818] [2025-01-09 11:04:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774859818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:04:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903244195] [2025-01-09 11:04:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:13,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:04:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:13,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:04:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:04:13,376 INFO L87 Difference]: Start difference. First operand 639 states and 931 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:04:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:17,794 INFO L93 Difference]: Finished difference Result 1081 states and 1537 transitions. [2025-01-09 11:04:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:04:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2025-01-09 11:04:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:17,798 INFO L225 Difference]: With dead ends: 1081 [2025-01-09 11:04:17,799 INFO L226 Difference]: Without dead ends: 859 [2025-01-09 11:04:17,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2025-01-09 11:04:17,802 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 608 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:17,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 833 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 11:04:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-09 11:04:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2025-01-09 11:04:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 581 states have (on average 1.4096385542168675) internal successors, (819), 581 states have internal predecessors, (819), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:04:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 939 transitions. [2025-01-09 11:04:17,854 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 939 transitions. Word has length 145 [2025-01-09 11:04:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 939 transitions. [2025-01-09 11:04:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:04:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 939 transitions. [2025-01-09 11:04:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 11:04:17,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:17,857 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:17,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:04:17,857 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1430703040, now seen corresponding path program 1 times [2025-01-09 11:04:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903241013] [2025-01-09 11:04:17,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:17,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 11:04:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 11:04:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:17,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat