./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9a61aaa8a2d24f80a58e864d1bce01bb7b7956b51190c2b8e5fc48a6872e407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:50:36,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:50:36,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:50:36,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:50:36,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:50:36,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:50:36,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:50:36,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:50:36,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:50:36,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:50:36,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:50:36,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:50:36,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:50:36,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:50:36,871 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:50:36,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:50:36,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:50:36,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:50:36,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:50:36,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:50:36,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:50:36,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:50:36,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:50:36,873 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 -> c9a61aaa8a2d24f80a58e864d1bce01bb7b7956b51190c2b8e5fc48a6872e407 [2025-01-09 10:50:37,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:50:37,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:50:37,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:50:37,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:50:37,123 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:50:37,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i [2025-01-09 10:50:38,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed87d6b48/ff9fc48d8cdf4356a10d3a9da27bfcb9/FLAG322c273fd [2025-01-09 10:50:38,579 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:50:38,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i [2025-01-09 10:50:38,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed87d6b48/ff9fc48d8cdf4356a10d3a9da27bfcb9/FLAG322c273fd [2025-01-09 10:50:38,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed87d6b48/ff9fc48d8cdf4356a10d3a9da27bfcb9 [2025-01-09 10:50:38,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:50:38,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:50:38,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:50:38,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:50:38,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:50:38,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:50:38" (1/1) ... [2025-01-09 10:50:38,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:38, skipping insertion in model container [2025-01-09 10:50:38,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:50:38" (1/1) ... [2025-01-09 10:50:38,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:50:38,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i[919,932] [2025-01-09 10:50:39,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:50:39,040 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:50:39,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i[919,932] [2025-01-09 10:50:39,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:50:39,088 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:50:39,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39 WrapperNode [2025-01-09 10:50:39,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:50:39,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:50:39,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:50:39,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:50:39,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,126 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-01-09 10:50:39,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:50:39,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:50:39,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:50:39,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:50:39,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:50:39,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:50:39,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:50:39,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:50:39,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:50:39,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (1/1) ... [2025-01-09 10:50:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:50:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:50:39,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:50:39,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:50:39,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:50:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:50:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:50:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:50:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:50:39,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:50:39,288 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:50:39,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:50:39,659 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 10:50:39,660 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:50:39,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:50:39,667 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:50:39,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:50:39 BoogieIcfgContainer [2025-01-09 10:50:39,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:50:39,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:50:39,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:50:39,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:50:39,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:50:38" (1/3) ... [2025-01-09 10:50:39,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648ab808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:50:39, skipping insertion in model container [2025-01-09 10:50:39,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:50:39" (2/3) ... [2025-01-09 10:50:39,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648ab808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:50:39, skipping insertion in model container [2025-01-09 10:50:39,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:50:39" (3/3) ... [2025-01-09 10:50:39,675 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i [2025-01-09 10:50:39,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:50:39,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-34.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:50:39,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:50:39,738 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;@5134fffc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:50:39,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:50:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 10:50:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 10:50:39,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:39,750 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:39,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1073178885, now seen corresponding path program 1 times [2025-01-09 10:50:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:39,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-01-09 10:50:39,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:39,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 10:50:39,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 10:50:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 10:50:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-01-09 10:50:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388213965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:50:39,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116975468] [2025-01-09 10:50:39,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:39,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:50:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:50:40,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:50:40,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:50:40,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 10:50:40,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 10:50:40,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:40,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:40,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:50:40,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:50:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 10:50:40,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:50:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116975468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:50:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:50:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937371459] [2025-01-09 10:50:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:50:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:40,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:50:40,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:50:40,193 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:50:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:40,220 INFO L93 Difference]: Finished difference Result 198 states and 344 transitions. [2025-01-09 10:50:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:50:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 179 [2025-01-09 10:50:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:40,228 INFO L225 Difference]: With dead ends: 198 [2025-01-09 10:50:40,229 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 10:50:40,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:50:40,237 INFO L435 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:40,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:50:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 10:50:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 10:50:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 10:50:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-01-09 10:50:40,282 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 179 [2025-01-09 10:50:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:40,283 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-01-09 10:50:40,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:50:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-01-09 10:50:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 10:50:40,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:40,286 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:40,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:50:40,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:50:40,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1616426891, now seen corresponding path program 1 times [2025-01-09 10:50:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656304492] [2025-01-09 10:50:40,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:40,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:40,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 10:50:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 10:50:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656304492] [2025-01-09 10:50:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656304492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:50:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476451632] [2025-01-09 10:50:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:50:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:40,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:50:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:50:40,908 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:41,032 INFO L93 Difference]: Finished difference Result 331 states and 526 transitions. [2025-01-09 10:50:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:50:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 10:50:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:41,034 INFO L225 Difference]: With dead ends: 331 [2025-01-09 10:50:41,035 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 10:50:41,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:50:41,035 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 175 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:41,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 505 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:50:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 10:50:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2025-01-09 10:50:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 138 states have (on average 1.4565217391304348) internal successors, (201), 138 states have internal predecessors, (201), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 10:50:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 309 transitions. [2025-01-09 10:50:41,074 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 309 transitions. Word has length 179 [2025-01-09 10:50:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:41,075 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 309 transitions. [2025-01-09 10:50:41,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 309 transitions. [2025-01-09 10:50:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 10:50:41,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:41,076 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:41,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:50:41,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:41,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1073593820, now seen corresponding path program 1 times [2025-01-09 10:50:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:41,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135307998] [2025-01-09 10:50:41,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 10:50:41,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 10:50:41,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:41,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135307998] [2025-01-09 10:50:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135307998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:50:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101805830] [2025-01-09 10:50:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:41,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:50:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:41,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:50:41,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:50:41,456 INFO L87 Difference]: Start difference. First operand 195 states and 309 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:41,801 INFO L93 Difference]: Finished difference Result 574 states and 910 transitions. [2025-01-09 10:50:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:50:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-01-09 10:50:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:41,804 INFO L225 Difference]: With dead ends: 574 [2025-01-09 10:50:41,804 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 10:50:41,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:50:41,808 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 194 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:41,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 456 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:50:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 10:50:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 199. [2025-01-09 10:50:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.443661971830986) internal successors, (205), 142 states have internal predecessors, (205), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 10:50:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2025-01-09 10:50:41,850 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 180 [2025-01-09 10:50:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:41,850 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2025-01-09 10:50:41,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2025-01-09 10:50:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:41,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:41,852 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:50:41,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -883484157, now seen corresponding path program 1 times [2025-01-09 10:50:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-01-09 10:50:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:41,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:42,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:48,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-01-09 10:50:48,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969012142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:50:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028726752] [2025-01-09 10:50:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:48,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:50:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:48,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:50:48,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:50:48,003 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:50,130 INFO L93 Difference]: Finished difference Result 811 states and 1269 transitions. [2025-01-09 10:50:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:50:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:50:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:50,136 INFO L225 Difference]: With dead ends: 811 [2025-01-09 10:50:50,136 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 10:50:50,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:50:50,138 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1027 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:50,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 630 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:50:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 10:50:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 429. [2025-01-09 10:50:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 309 states have (on average 1.4530744336569579) internal successors, (449), 310 states have internal predecessors, (449), 113 states have call successors, (113), 6 states have call predecessors, (113), 6 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 10:50:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 675 transitions. [2025-01-09 10:50:50,210 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 675 transitions. Word has length 181 [2025-01-09 10:50:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:50,210 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 675 transitions. [2025-01-09 10:50:50,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 675 transitions. [2025-01-09 10:50:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:50,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:50,214 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:50,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:50:50,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1894601407, now seen corresponding path program 1 times [2025-01-09 10:50:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:50,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545920523] [2025-01-09 10:50:50,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:50,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545920523] [2025-01-09 10:50:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545920523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:50:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117593683] [2025-01-09 10:50:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:50:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:52,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:50:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:50:52,021 INFO L87 Difference]: Start difference. First operand 429 states and 675 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:53,340 INFO L93 Difference]: Finished difference Result 1401 states and 2224 transitions. [2025-01-09 10:50:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:50:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:50:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:53,345 INFO L225 Difference]: With dead ends: 1401 [2025-01-09 10:50:53,345 INFO L226 Difference]: Without dead ends: 983 [2025-01-09 10:50:53,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:50:53,348 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 499 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:53,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 614 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:50:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-01-09 10:50:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 537. [2025-01-09 10:50:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 394 states have (on average 1.4340101522842639) internal successors, (565), 394 states have internal predecessors, (565), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:50:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 835 transitions. [2025-01-09 10:50:53,401 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 835 transitions. Word has length 181 [2025-01-09 10:50:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:53,402 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 835 transitions. [2025-01-09 10:50:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 835 transitions. [2025-01-09 10:50:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:53,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:53,404 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:50:53,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:53,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1904552511, now seen corresponding path program 1 times [2025-01-09 10:50:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:53,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726118212] [2025-01-09 10:50:53,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:53,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726118212] [2025-01-09 10:50:56,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726118212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:56,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:50:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879989492] [2025-01-09 10:50:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:50:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:56,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:50:56,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:50:56,002 INFO L87 Difference]: Start difference. First operand 537 states and 835 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:56,620 INFO L93 Difference]: Finished difference Result 1489 states and 2331 transitions. [2025-01-09 10:50:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:50:56,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:50:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:56,625 INFO L225 Difference]: With dead ends: 1489 [2025-01-09 10:50:56,625 INFO L226 Difference]: Without dead ends: 1010 [2025-01-09 10:50:56,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:50:56,627 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 502 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:56,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 535 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:50:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-01-09 10:50:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 822. [2025-01-09 10:50:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 679 states have (on average 1.5213549337260677) internal successors, (1033), 679 states have internal predecessors, (1033), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:50:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1303 transitions. [2025-01-09 10:50:56,673 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1303 transitions. Word has length 181 [2025-01-09 10:50:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1303 transitions. [2025-01-09 10:50:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1303 transitions. [2025-01-09 10:50:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:56,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:56,675 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:56,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:50:56,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:56,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 721949234, now seen corresponding path program 1 times [2025-01-09 10:50:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543390464] [2025-01-09 10:50:56,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:56,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:56,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:56,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:57,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:57,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543390464] [2025-01-09 10:50:57,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543390464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:57,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:50:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195446059] [2025-01-09 10:50:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:50:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:57,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:50:57,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:50:57,883 INFO L87 Difference]: Start difference. First operand 822 states and 1303 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:58,315 INFO L93 Difference]: Finished difference Result 1374 states and 2177 transitions. [2025-01-09 10:50:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:50:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:50:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:58,322 INFO L225 Difference]: With dead ends: 1374 [2025-01-09 10:50:58,322 INFO L226 Difference]: Without dead ends: 1086 [2025-01-09 10:50:58,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:50:58,324 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 272 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:58,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 488 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:50:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-01-09 10:50:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 828. [2025-01-09 10:50:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 685 states have (on average 1.513868613138686) internal successors, (1037), 685 states have internal predecessors, (1037), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:50:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1307 transitions. [2025-01-09 10:50:58,372 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1307 transitions. Word has length 181 [2025-01-09 10:50:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:58,375 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1307 transitions. [2025-01-09 10:50:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1307 transitions. [2025-01-09 10:50:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:58,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:58,378 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:50:58,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1471899581, now seen corresponding path program 1 times [2025-01-09 10:50:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-01-09 10:50:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:50:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:50:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:50:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-01-09 10:50:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624145743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:50:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:50:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:50:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541738468] [2025-01-09 10:50:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:50:58,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:50:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:50:58,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:50:58,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:50:58,723 INFO L87 Difference]: Start difference. First operand 828 states and 1307 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:50:59,264 INFO L93 Difference]: Finished difference Result 1778 states and 2833 transitions. [2025-01-09 10:50:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:50:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:50:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:50:59,274 INFO L225 Difference]: With dead ends: 1778 [2025-01-09 10:50:59,274 INFO L226 Difference]: Without dead ends: 1248 [2025-01-09 10:50:59,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:50:59,276 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 347 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:50:59,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 569 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:50:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-01-09 10:50:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 860. [2025-01-09 10:50:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 717 states have (on average 1.499302649930265) internal successors, (1075), 717 states have internal predecessors, (1075), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:50:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1345 transitions. [2025-01-09 10:50:59,326 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1345 transitions. Word has length 181 [2025-01-09 10:50:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:50:59,326 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1345 transitions. [2025-01-09 10:50:59,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:50:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1345 transitions. [2025-01-09 10:50:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:50:59,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:50:59,328 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:50:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:50:59,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:50:59,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:50:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1481850685, now seen corresponding path program 1 times [2025-01-09 10:50:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:50:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383660567] [2025-01-09 10:50:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:50:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:50:59,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:50:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:50:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:50:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383660567] [2025-01-09 10:51:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383660567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:51:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881391350] [2025-01-09 10:51:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:00,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:51:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:00,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:51:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:51:00,072 INFO L87 Difference]: Start difference. First operand 860 states and 1345 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:00,743 INFO L93 Difference]: Finished difference Result 1616 states and 2523 transitions. [2025-01-09 10:51:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:51:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:51:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:00,753 INFO L225 Difference]: With dead ends: 1616 [2025-01-09 10:51:00,757 INFO L226 Difference]: Without dead ends: 1130 [2025-01-09 10:51:00,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:51:00,762 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 328 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:00,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 589 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:51:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-01-09 10:51:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 832. [2025-01-09 10:51:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 689 states have (on average 1.4847605224963716) internal successors, (1023), 689 states have internal predecessors, (1023), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:51:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1293 transitions. [2025-01-09 10:51:00,826 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1293 transitions. Word has length 181 [2025-01-09 10:51:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:00,827 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1293 transitions. [2025-01-09 10:51:00,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1293 transitions. [2025-01-09 10:51:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 10:51:00,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:00,830 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:51:00,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1144651060, now seen corresponding path program 1 times [2025-01-09 10:51:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512726831] [2025-01-09 10:51:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:00,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 10:51:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 10:51:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512726831] [2025-01-09 10:51:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512726831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:51:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655198229] [2025-01-09 10:51:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:01,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:51:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:01,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:51:01,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:51:01,055 INFO L87 Difference]: Start difference. First operand 832 states and 1293 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:01,305 INFO L93 Difference]: Finished difference Result 1454 states and 2285 transitions. [2025-01-09 10:51:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:51:01,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 10:51:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:01,310 INFO L225 Difference]: With dead ends: 1454 [2025-01-09 10:51:01,310 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 10:51:01,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:51:01,312 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 108 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:01,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 386 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:51:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 10:51:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 754. [2025-01-09 10:51:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 611 states have (on average 1.4844517184942716) internal successors, (907), 611 states have internal predecessors, (907), 135 states have call successors, (135), 7 states have call predecessors, (135), 7 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:51:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1177 transitions. [2025-01-09 10:51:01,357 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1177 transitions. Word has length 181 [2025-01-09 10:51:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1177 transitions. [2025-01-09 10:51:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1177 transitions. [2025-01-09 10:51:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 10:51:01,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:01,359 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:01,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:51:01,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 467739599, now seen corresponding path program 1 times [2025-01-09 10:51:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757180343] [2025-01-09 10:51:01,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:01,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 10:51:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 10:51:01,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:01,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757180343] [2025-01-09 10:51:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757180343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:51:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439989738] [2025-01-09 10:51:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:03,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:51:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:03,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:51:03,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:51:03,874 INFO L87 Difference]: Start difference. First operand 754 states and 1177 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:05,688 INFO L93 Difference]: Finished difference Result 1318 states and 2068 transitions. [2025-01-09 10:51:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:51:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 10:51:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:05,695 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 10:51:05,695 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 10:51:05,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:51:05,697 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 387 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:05,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 823 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:51:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 10:51:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 856. [2025-01-09 10:51:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 711 states have (on average 1.4978902953586497) internal successors, (1065), 711 states have internal predecessors, (1065), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:51:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1335 transitions. [2025-01-09 10:51:05,768 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1335 transitions. Word has length 182 [2025-01-09 10:51:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:05,769 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1335 transitions. [2025-01-09 10:51:05,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1335 transitions. [2025-01-09 10:51:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 10:51:05,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:05,771 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:05,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:51:05,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1182960999, now seen corresponding path program 1 times [2025-01-09 10:51:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321313458] [2025-01-09 10:51:05,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:05,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 10:51:05,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 10:51:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321313458] [2025-01-09 10:51:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321313458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:51:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139718506] [2025-01-09 10:51:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:51:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:10,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:51:10,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:51:10,995 INFO L87 Difference]: Start difference. First operand 856 states and 1335 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:13,413 INFO L93 Difference]: Finished difference Result 1728 states and 2686 transitions. [2025-01-09 10:51:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:51:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 10:51:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:13,419 INFO L225 Difference]: With dead ends: 1728 [2025-01-09 10:51:13,419 INFO L226 Difference]: Without dead ends: 1003 [2025-01-09 10:51:13,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 10:51:13,422 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 429 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:13,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 932 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:51:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-01-09 10:51:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 875. [2025-01-09 10:51:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 730 states have (on average 1.5041095890410958) internal successors, (1098), 730 states have internal predecessors, (1098), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:51:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1368 transitions. [2025-01-09 10:51:13,468 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1368 transitions. Word has length 182 [2025-01-09 10:51:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1368 transitions. [2025-01-09 10:51:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1368 transitions. [2025-01-09 10:51:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 10:51:13,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:13,470 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:51:13,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash -346788424, now seen corresponding path program 1 times [2025-01-09 10:51:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244957731] [2025-01-09 10:51:13,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:13,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 10:51:13,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 10:51:13,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:13,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244957731] [2025-01-09 10:51:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244957731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:51:20,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858397922] [2025-01-09 10:51:20,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:20,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:51:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:20,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:51:20,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:51:20,690 INFO L87 Difference]: Start difference. First operand 875 states and 1368 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:22,245 INFO L93 Difference]: Finished difference Result 1543 states and 2373 transitions. [2025-01-09 10:51:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:51:22,246 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 10:51:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:22,249 INFO L225 Difference]: With dead ends: 1543 [2025-01-09 10:51:22,249 INFO L226 Difference]: Without dead ends: 1017 [2025-01-09 10:51:22,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-01-09 10:51:22,251 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 569 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:22,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 703 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:51:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-09 10:51:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 869. [2025-01-09 10:51:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 724 states have (on average 1.488950276243094) internal successors, (1078), 724 states have internal predecessors, (1078), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:51:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1348 transitions. [2025-01-09 10:51:22,301 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1348 transitions. Word has length 183 [2025-01-09 10:51:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:22,301 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1348 transitions. [2025-01-09 10:51:22,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1348 transitions. [2025-01-09 10:51:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 10:51:22,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:22,305 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:51:22,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:22,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1688634748, now seen corresponding path program 1 times [2025-01-09 10:51:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588699977] [2025-01-09 10:51:22,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:22,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 10:51:22,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 10:51:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588699977] [2025-01-09 10:51:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588699977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:51:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170955799] [2025-01-09 10:51:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:51:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:51:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:51:29,509 INFO L87 Difference]: Start difference. First operand 869 states and 1348 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:33,528 INFO L93 Difference]: Finished difference Result 1880 states and 2958 transitions. [2025-01-09 10:51:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:51:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 10:51:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:33,536 INFO L225 Difference]: With dead ends: 1880 [2025-01-09 10:51:33,537 INFO L226 Difference]: Without dead ends: 1372 [2025-01-09 10:51:33,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2025-01-09 10:51:33,538 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 484 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 932 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 10:51:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-01-09 10:51:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1117. [2025-01-09 10:51:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 914 states have (on average 1.4693654266958425) internal successors, (1343), 914 states have internal predecessors, (1343), 189 states have call successors, (189), 13 states have call predecessors, (189), 13 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-01-09 10:51:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1721 transitions. [2025-01-09 10:51:33,608 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1721 transitions. Word has length 183 [2025-01-09 10:51:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1721 transitions. [2025-01-09 10:51:33,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1721 transitions. [2025-01-09 10:51:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 10:51:33,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:33,610 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:33,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:51:33,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:33,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1698585852, now seen corresponding path program 1 times [2025-01-09 10:51:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157534546] [2025-01-09 10:51:33,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:33,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 10:51:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 10:51:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157534546] [2025-01-09 10:51:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157534546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:36,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:51:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402415057] [2025-01-09 10:51:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:36,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:51:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:36,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:51:36,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:51:36,245 INFO L87 Difference]: Start difference. First operand 1117 states and 1721 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:38,296 INFO L93 Difference]: Finished difference Result 2316 states and 3557 transitions. [2025-01-09 10:51:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:51:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 10:51:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:38,302 INFO L225 Difference]: With dead ends: 2316 [2025-01-09 10:51:38,302 INFO L226 Difference]: Without dead ends: 1429 [2025-01-09 10:51:38,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:51:38,305 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 486 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:38,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 808 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 10:51:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-01-09 10:51:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1221. [2025-01-09 10:51:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1018 states have (on average 1.4675834970530452) internal successors, (1494), 1018 states have internal predecessors, (1494), 189 states have call successors, (189), 13 states have call predecessors, (189), 13 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-01-09 10:51:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1872 transitions. [2025-01-09 10:51:38,383 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1872 transitions. Word has length 183 [2025-01-09 10:51:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:38,383 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1872 transitions. [2025-01-09 10:51:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:51:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1872 transitions. [2025-01-09 10:51:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 10:51:38,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:38,385 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:51:38,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:38,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1585264194, now seen corresponding path program 1 times [2025-01-09 10:51:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895405513] [2025-01-09 10:51:38,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:38,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 10:51:38,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 10:51:38,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:38,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:51:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895405513] [2025-01-09 10:51:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895405513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:51:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132871904] [2025-01-09 10:51:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:51:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:52,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:51:52,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:51:52,516 INFO L87 Difference]: Start difference. First operand 1221 states and 1872 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:51:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:58,533 INFO L93 Difference]: Finished difference Result 2007 states and 3049 transitions. [2025-01-09 10:51:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:51:58,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 183 [2025-01-09 10:51:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:58,538 INFO L225 Difference]: With dead ends: 2007 [2025-01-09 10:51:58,539 INFO L226 Difference]: Without dead ends: 1311 [2025-01-09 10:51:58,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2025-01-09 10:51:58,541 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 338 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1232 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 10:51:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-01-09 10:51:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1249. [2025-01-09 10:51:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1038 states have (on average 1.4489402697495184) internal successors, (1504), 1040 states have internal predecessors, (1504), 195 states have call successors, (195), 15 states have call predecessors, (195), 15 states have return successors, (195), 193 states have call predecessors, (195), 195 states have call successors, (195) [2025-01-09 10:51:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1894 transitions. [2025-01-09 10:51:58,628 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1894 transitions. Word has length 183 [2025-01-09 10:51:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:58,628 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1894 transitions. [2025-01-09 10:51:58,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:51:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1894 transitions. [2025-01-09 10:51:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 10:51:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:58,630 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:51:58,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:58,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash 667465710, now seen corresponding path program 1 times [2025-01-09 10:51:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611099090] [2025-01-09 10:51:58,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:58,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 10:51:58,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 10:51:58,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:58,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat