./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-27.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_floatingpointinfluence_has-floats_file-27.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 c02d96b2e66c5d16a70019b8ee62d80e443fba6c783a0dd61954285e06f10d7d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:28:13,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:28:13,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:28:13,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:28:13,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:28:13,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:28:13,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:28:13,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:28:13,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:28:13,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:28:13,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:28:13,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:28:13,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:28:13,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:28:13,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:28:13,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:28:13,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:28:13,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:28:13,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:28:13,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:28:13,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:28:13,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:28:13,773 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 -> c02d96b2e66c5d16a70019b8ee62d80e443fba6c783a0dd61954285e06f10d7d [2025-01-09 12:28:13,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:28:13,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:28:13,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:28:13,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:28:13,990 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:28:13,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-27.i [2025-01-09 12:28:15,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aed04360/23164934d3e34215a5996363452c8938/FLAGc55bdfa5b [2025-01-09 12:28:15,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:28:15,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-27.i [2025-01-09 12:28:15,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aed04360/23164934d3e34215a5996363452c8938/FLAGc55bdfa5b [2025-01-09 12:28:15,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aed04360/23164934d3e34215a5996363452c8938 [2025-01-09 12:28:15,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:28:15,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:28:15,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:28:15,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:28:15,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:28:15,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:28:15" (1/1) ... [2025-01-09 12:28:15,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:15, skipping insertion in model container [2025-01-09 12:28:15,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:28:15" (1/1) ... [2025-01-09 12:28:15,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:28:15,977 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_floatingpointinfluence_has-floats_file-27.i[917,930] [2025-01-09 12:28:16,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:28:16,020 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:28:16,027 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_floatingpointinfluence_has-floats_file-27.i[917,930] [2025-01-09 12:28:16,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:28:16,049 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:28:16,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16 WrapperNode [2025-01-09 12:28:16,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:28:16,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:28:16,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:28:16,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:28:16,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,081 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-01-09 12:28:16,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:28:16,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:28:16,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:28:16,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:28:16,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,101 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 12:28:16,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:28:16,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:28:16,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:28:16,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:28:16,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (1/1) ... [2025-01-09 12:28:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:28:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:28:16,152 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 12:28:16,158 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 12:28:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:28:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:28:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:28:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:28:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:28:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:28:16,222 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:28:16,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:28:16,402 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:28:16,403 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:28:16,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:28:16,410 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:28:16,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:28:16 BoogieIcfgContainer [2025-01-09 12:28:16,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:28:16,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:28:16,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:28:16,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:28:16,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:28:15" (1/3) ... [2025-01-09 12:28:16,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3584c69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:28:16, skipping insertion in model container [2025-01-09 12:28:16,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:28:16" (2/3) ... [2025-01-09 12:28:16,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3584c69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:28:16, skipping insertion in model container [2025-01-09 12:28:16,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:28:16" (3/3) ... [2025-01-09 12:28:16,417 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-27.i [2025-01-09 12:28:16,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:28:16,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-27.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:28:16,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:28:16,476 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;@5f906a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:28:16,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:28:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:28:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:28:16,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:16,485 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:16,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:16,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1078104464, now seen corresponding path program 1 times [2025-01-09 12:28:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485607626] [2025-01-09 12:28:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:16,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:16,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 12:28:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485607626] [2025-01-09 12:28:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485607626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:28:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538624236] [2025-01-09 12:28:16,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:16,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:28:16,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:28:16,700 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 12:28:16,704 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 12:28:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:16,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:16,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:16,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:28:16,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:28:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 12:28:16,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:28:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538624236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:28:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:28:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001638856] [2025-01-09 12:28:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:28:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:16,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:28:16,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:28:16,888 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:28:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:16,903 INFO L93 Difference]: Finished difference Result 98 states and 164 transitions. [2025-01-09 12:28:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:28:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2025-01-09 12:28:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:16,909 INFO L225 Difference]: With dead ends: 98 [2025-01-09 12:28:16,909 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 12:28:16,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 12:28:16,913 INFO L435 NwaCegarLoop]: 71 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, 71 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 12:28:16,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:28:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 12:28:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 12:28:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:28:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-01-09 12:28:16,941 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 109 [2025-01-09 12:28:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:16,942 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-01-09 12:28:16,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:28:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-01-09 12:28:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:28:16,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:16,944 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:16,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:28:17,148 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 12:28:17,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 375817746, now seen corresponding path program 1 times [2025-01-09 12:28:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-01-09 12:28:17,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:17,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:17,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:17,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:17,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:21,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:21,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-01-09 12:28:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61501919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:28:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62490533] [2025-01-09 12:28:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:28:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:21,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:28:21,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:28:21,995 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:22,392 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2025-01-09 12:28:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:28:22,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-01-09 12:28:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:22,394 INFO L225 Difference]: With dead ends: 110 [2025-01-09 12:28:22,394 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 12:28:22,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:22,395 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:22,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 282 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:28:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 12:28:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2025-01-09 12:28:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:28:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2025-01-09 12:28:22,407 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 109 [2025-01-09 12:28:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:22,407 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2025-01-09 12:28:22,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2025-01-09 12:28:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:28:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:22,409 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:28:22,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2144142188, now seen corresponding path program 1 times [2025-01-09 12:28:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-01-09 12:28:22,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:22,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:22,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:22,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:22,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-01-09 12:28:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593200000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:24,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:28:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116214797] [2025-01-09 12:28:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:24,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:28:24,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:24,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:28:24,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:28:24,397 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:24,783 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2025-01-09 12:28:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:28:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-01-09 12:28:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:24,785 INFO L225 Difference]: With dead ends: 108 [2025-01-09 12:28:24,785 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 12:28:24,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:24,786 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 65 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:24,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 337 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:28:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 12:28:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2025-01-09 12:28:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:28:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2025-01-09 12:28:24,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 109 [2025-01-09 12:28:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2025-01-09 12:28:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2025-01-09 12:28:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:28:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:24,807 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:24,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:28:24,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1076882324, now seen corresponding path program 1 times [2025-01-09 12:28:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10728029] [2025-01-09 12:28:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:24,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:24,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:24,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:24,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10728029] [2025-01-09 12:28:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10728029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:28:25,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111920634] [2025-01-09 12:28:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:25,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:28:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:25,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:28:25,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:28:25,970 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:26,273 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2025-01-09 12:28:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:28:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-01-09 12:28:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:26,276 INFO L225 Difference]: With dead ends: 185 [2025-01-09 12:28:26,276 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 12:28:26,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:28:26,277 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:26,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 398 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:28:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 12:28:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 75. [2025-01-09 12:28:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 54 states have internal predecessors, (65), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:28:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-01-09 12:28:26,287 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 109 [2025-01-09 12:28:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:26,288 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-01-09 12:28:26,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-01-09 12:28:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:28:26,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:26,292 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:28:26,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1443077610, now seen corresponding path program 1 times [2025-01-09 12:28:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-01-09 12:28:26,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:28:26,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:28:26,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:26,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-01-09 12:28:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204955810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:27,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:28:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687963097] [2025-01-09 12:28:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:28:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:27,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:28:27,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:28:27,300 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:27,617 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2025-01-09 12:28:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:28:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-01-09 12:28:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:27,621 INFO L225 Difference]: With dead ends: 126 [2025-01-09 12:28:27,621 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 12:28:27,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:28:27,622 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 71 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:27,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 483 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:28:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 12:28:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2025-01-09 12:28:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:28:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2025-01-09 12:28:27,644 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 109 [2025-01-09 12:28:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:27,646 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2025-01-09 12:28:27,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2025-01-09 12:28:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:28:27,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:27,648 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:27,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:28:27,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1481988869, now seen corresponding path program 1 times [2025-01-09 12:28:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-01-09 12:28:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:27,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:28:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:28:27,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:27,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-01-09 12:28:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352164108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:29,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:29,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:28:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373561841] [2025-01-09 12:28:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:28:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:29,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:28:29,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:28:29,207 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:29,912 INFO L93 Difference]: Finished difference Result 314 states and 416 transitions. [2025-01-09 12:28:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:28:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:28:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:29,914 INFO L225 Difference]: With dead ends: 314 [2025-01-09 12:28:29,914 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 12:28:29,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:28:29,915 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 135 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:29,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 393 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:28:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 12:28:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 191. [2025-01-09 12:28:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 130 states have (on average 1.176923076923077) internal successors, (153), 133 states have internal predecessors, (153), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:28:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2025-01-09 12:28:29,937 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 257 transitions. Word has length 110 [2025-01-09 12:28:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 257 transitions. [2025-01-09 12:28:29,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 257 transitions. [2025-01-09 12:28:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:28:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:29,938 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:28:29,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1037971065, now seen corresponding path program 1 times [2025-01-09 12:28:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-01-09 12:28:29,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:28:29,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:28:29,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:29,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-01-09 12:28:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113651294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:28:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934197] [2025-01-09 12:28:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:28:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:29,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:28:29,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:28:29,993 INFO L87 Difference]: Start difference. First operand 191 states and 257 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:30,073 INFO L93 Difference]: Finished difference Result 456 states and 613 transitions. [2025-01-09 12:28:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:28:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:28:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:30,080 INFO L225 Difference]: With dead ends: 456 [2025-01-09 12:28:30,080 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 12:28:30,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:28:30,084 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 31 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:30,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 215 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:28:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 12:28:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2025-01-09 12:28:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 180 states have (on average 1.1555555555555554) internal successors, (208), 184 states have internal predecessors, (208), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 12:28:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 362 transitions. [2025-01-09 12:28:30,129 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 362 transitions. Word has length 110 [2025-01-09 12:28:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:30,130 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 362 transitions. [2025-01-09 12:28:30,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 362 transitions. [2025-01-09 12:28:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:28:30,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:30,131 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:30,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:28:30,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1470112062, now seen corresponding path program 1 times [2025-01-09 12:28:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595825607] [2025-01-09 12:28:30,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:28:30,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:28:30,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:30,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:35,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595825607] [2025-01-09 12:28:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595825607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:35,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:35,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:28:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873384141] [2025-01-09 12:28:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:28:35,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:35,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:28:35,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:35,217 INFO L87 Difference]: Start difference. First operand 270 states and 362 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:40,115 INFO L93 Difference]: Finished difference Result 313 states and 410 transitions. [2025-01-09 12:28:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:28:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:28:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:40,118 INFO L225 Difference]: With dead ends: 313 [2025-01-09 12:28:40,118 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 12:28:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:28:40,119 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:40,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 381 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:28:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 12:28:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 275. [2025-01-09 12:28:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 185 states have (on average 1.1675675675675676) internal successors, (216), 189 states have internal predecessors, (216), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 12:28:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2025-01-09 12:28:40,154 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 110 [2025-01-09 12:28:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2025-01-09 12:28:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2025-01-09 12:28:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:28:40,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:40,156 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:40,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:28:40,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2015508608, now seen corresponding path program 1 times [2025-01-09 12:28:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 12:28:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:28:40,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:28:40,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:40,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:44,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 12:28:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217468550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:28:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848519128] [2025-01-09 12:28:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:44,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:28:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:44,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:28:44,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:44,082 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:46,051 INFO L93 Difference]: Finished difference Result 308 states and 405 transitions. [2025-01-09 12:28:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:28:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:28:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:46,057 INFO L225 Difference]: With dead ends: 308 [2025-01-09 12:28:46,057 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 12:28:46,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:28:46,058 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:46,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 504 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:28:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 12:28:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 275. [2025-01-09 12:28:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 185 states have (on average 1.1675675675675676) internal successors, (216), 189 states have internal predecessors, (216), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 12:28:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2025-01-09 12:28:46,087 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 110 [2025-01-09 12:28:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2025-01-09 12:28:46,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2025-01-09 12:28:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:28:46,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:46,088 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:46,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:28:46,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:46,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1740154307, now seen corresponding path program 1 times [2025-01-09 12:28:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136831006] [2025-01-09 12:28:46,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:46,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:28:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:28:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136831006] [2025-01-09 12:28:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136831006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:28:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000870968] [2025-01-09 12:28:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:47,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:28:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:47,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:28:47,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:28:47,753 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:28:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:48,398 INFO L93 Difference]: Finished difference Result 337 states and 454 transitions. [2025-01-09 12:28:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:28:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-01-09 12:28:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:48,402 INFO L225 Difference]: With dead ends: 337 [2025-01-09 12:28:48,402 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 12:28:48,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:28:48,404 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 86 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:48,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 398 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:28:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 12:28:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-01-09 12:28:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 219 states have (on average 1.1506849315068493) internal successors, (252), 223 states have internal predecessors, (252), 100 states have call successors, (100), 15 states have call predecessors, (100), 15 states have return successors, (100), 96 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 12:28:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 452 transitions. [2025-01-09 12:28:48,438 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 452 transitions. Word has length 110 [2025-01-09 12:28:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:48,439 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 452 transitions. [2025-01-09 12:28:48,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:28:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 452 transitions. [2025-01-09 12:28:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 12:28:48,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:48,440 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:28:48,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1145518607, now seen corresponding path program 1 times [2025-01-09 12:28:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-01-09 12:28:48,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:48,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 12:28:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 12:28:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:51,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:51,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-01-09 12:28:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670656661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:51,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:28:51,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422744218] [2025-01-09 12:28:51,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:28:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:51,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:28:51,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:51,514 INFO L87 Difference]: Start difference. First operand 335 states and 452 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:52,923 INFO L93 Difference]: Finished difference Result 495 states and 658 transitions. [2025-01-09 12:28:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:28:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-01-09 12:28:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:52,925 INFO L225 Difference]: With dead ends: 495 [2025-01-09 12:28:52,925 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 12:28:52,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:28:52,926 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 111 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:52,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 493 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:28:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 12:28:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 250. [2025-01-09 12:28:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 163 states have (on average 1.1411042944785277) internal successors, (186), 166 states have internal predecessors, (186), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 12:28:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 336 transitions. [2025-01-09 12:28:52,958 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 336 transitions. Word has length 111 [2025-01-09 12:28:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 336 transitions. [2025-01-09 12:28:52,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 336 transitions. [2025-01-09 12:28:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 12:28:52,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:52,961 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:52,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:28:52,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:52,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1143671565, now seen corresponding path program 1 times [2025-01-09 12:28:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364450855] [2025-01-09 12:28:52,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:52,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 12:28:52,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 12:28:52,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:52,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:55,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364450855] [2025-01-09 12:28:55,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364450855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:55,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:55,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:28:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654303076] [2025-01-09 12:28:55,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:55,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:28:55,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:55,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:28:55,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:55,466 INFO L87 Difference]: Start difference. First operand 250 states and 336 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:56,537 INFO L93 Difference]: Finished difference Result 300 states and 390 transitions. [2025-01-09 12:28:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:28:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-01-09 12:28:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:56,540 INFO L225 Difference]: With dead ends: 300 [2025-01-09 12:28:56,541 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 12:28:56,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:28:56,545 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:56,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 490 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:28:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 12:28:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 249. [2025-01-09 12:28:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 162 states have (on average 1.1358024691358024) internal successors, (184), 165 states have internal predecessors, (184), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 12:28:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 334 transitions. [2025-01-09 12:28:56,568 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 334 transitions. Word has length 111 [2025-01-09 12:28:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:56,569 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 334 transitions. [2025-01-09 12:28:56,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:28:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 334 transitions. [2025-01-09 12:28:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 12:28:56,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:56,570 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:28:56,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1954865233, now seen corresponding path program 1 times [2025-01-09 12:28:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:28:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731484099] [2025-01-09 12:28:56,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:28:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 12:28:56,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 12:28:56,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:56,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:28:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:28:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731484099] [2025-01-09 12:28:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731484099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:28:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:28:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:28:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644515244] [2025-01-09 12:28:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:28:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:28:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:28:59,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:28:59,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:28:59,695 INFO L87 Difference]: Start difference. First operand 249 states and 334 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:29:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:01,544 INFO L93 Difference]: Finished difference Result 292 states and 380 transitions. [2025-01-09 12:29:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:29:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-01-09 12:29:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:01,547 INFO L225 Difference]: With dead ends: 292 [2025-01-09 12:29:01,547 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 12:29:01,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:29:01,547 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 94 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:01,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 521 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:29:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 12:29:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 250. [2025-01-09 12:29:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 163 states have (on average 1.1411042944785277) internal successors, (186), 166 states have internal predecessors, (186), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 12:29:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 336 transitions. [2025-01-09 12:29:01,568 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 336 transitions. Word has length 111 [2025-01-09 12:29:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:01,568 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 336 transitions. [2025-01-09 12:29:01,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:29:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 336 transitions. [2025-01-09 12:29:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 12:29:01,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:01,571 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:01,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:29:01,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:01,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1953018191, now seen corresponding path program 1 times [2025-01-09 12:29:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954524139] [2025-01-09 12:29:01,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:01,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 12:29:01,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 12:29:01,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:01,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:29:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954524139] [2025-01-09 12:29:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954524139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:29:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135042885] [2025-01-09 12:29:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:04,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:29:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:04,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:29:04,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:29:04,925 INFO L87 Difference]: Start difference. First operand 250 states and 336 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:29:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:09,819 INFO L93 Difference]: Finished difference Result 287 states and 375 transitions. [2025-01-09 12:29:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:29:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-01-09 12:29:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:09,821 INFO L225 Difference]: With dead ends: 287 [2025-01-09 12:29:09,821 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 12:29:09,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:29:09,821 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:09,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 617 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:29:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 12:29:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 247. [2025-01-09 12:29:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 160 states have (on average 1.1375) internal successors, (182), 163 states have internal predecessors, (182), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 12:29:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 332 transitions. [2025-01-09 12:29:09,845 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 332 transitions. Word has length 111 [2025-01-09 12:29:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:09,846 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 332 transitions. [2025-01-09 12:29:09,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:29:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 332 transitions. [2025-01-09 12:29:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 12:29:09,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:09,848 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:09,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:29:09,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 246088115, now seen corresponding path program 1 times [2025-01-09 12:29:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-01-09 12:29:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 12:29:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 12:29:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:29:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-01-09 12:29:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195066169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267047492] [2025-01-09 12:29:11,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:11,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:29:11,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:29:11,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:29:11,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:29:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 12:29:11,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 12:29:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:11,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:29:11,579 INFO L279 TraceCheckSpWp]: Computing forward predicates...