./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.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_codestructure_dependencies_file-86.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 d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:33:51,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:33:51,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:33:51,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:33:51,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:33:51,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:33:51,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:33:51,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:33:51,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:33:51,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:33:51,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:33:51,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:33:51,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:33:51,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:33:51,385 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:33:51,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:33:51,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:33:51,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:33:51,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:33:51,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:33:51,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:33:51,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:33:51,388 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 -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2025-01-09 08:33:51,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:33:51,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:33:51,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:33:51,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:33:51,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:33:51,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2025-01-09 08:33:52,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308e22441/e1b135c5d2b444589f4941f3379542fa/FLAGb2c909db4 [2025-01-09 08:33:53,055 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:33:53,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2025-01-09 08:33:53,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308e22441/e1b135c5d2b444589f4941f3379542fa/FLAGb2c909db4 [2025-01-09 08:33:53,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308e22441/e1b135c5d2b444589f4941f3379542fa [2025-01-09 08:33:53,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:33:53,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:33:53,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:33:53,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:33:53,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:33:53,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53, skipping insertion in model container [2025-01-09 08:33:53,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:33:53,281 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_codestructure_dependencies_file-86.i[919,932] [2025-01-09 08:33:53,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:33:53,353 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:33:53,361 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_codestructure_dependencies_file-86.i[919,932] [2025-01-09 08:33:53,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:33:53,416 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:33:53,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53 WrapperNode [2025-01-09 08:33:53,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:33:53,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:33:53,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:33:53,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:33:53,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,488 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 08:33:53,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:33:53,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:33:53,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:33:53,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:33:53,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,523 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 08:33:53,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:33:53,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:33:53,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:33:53,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:33:53,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (1/1) ... [2025-01-09 08:33:53,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:33:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:33:53,565 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 08:33:53,567 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 08:33:53,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:33:53,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:33:53,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:33:53,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:33:53,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:33:53,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:33:53,638 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:33:53,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:33:53,831 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:33:53,831 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:33:53,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:33:53,837 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:33:53,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:33:53 BoogieIcfgContainer [2025-01-09 08:33:53,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:33:53,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:33:53,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:33:53,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:33:53,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:33:53" (1/3) ... [2025-01-09 08:33:53,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f432cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:33:53, skipping insertion in model container [2025-01-09 08:33:53,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:33:53" (2/3) ... [2025-01-09 08:33:53,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f432cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:33:53, skipping insertion in model container [2025-01-09 08:33:53,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:33:53" (3/3) ... [2025-01-09 08:33:53,844 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2025-01-09 08:33:53,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:33:53,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-86.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:33:53,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:33:53,900 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;@1a95ccc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:33:53,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:33:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 08:33:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 08:33:53,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:33:53,909 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:53,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:33:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:33:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1801928643, now seen corresponding path program 1 times [2025-01-09 08:33:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:33:53,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-01-09 08:33:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:33:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:33:53,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:33:53,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:33:53,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:33:53,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:33:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 08:33:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:33:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-01-09 08:33:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135840197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:33:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321100360] [2025-01-09 08:33:54,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:33:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:33:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:33:54,116 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 08:33:54,118 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 08:33:54,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:33:54,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:33:54,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:33:54,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:33:54,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:33:54,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:33:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 08:33:54,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:33:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321100360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:33:54,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:33:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:33:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-01-09 08:33:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:33:54,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:33:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:33:54,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:33:54,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:33:54,302 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 08:33:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:33:54,332 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2025-01-09 08:33:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:33:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-01-09 08:33:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:33:54,341 INFO L225 Difference]: With dead ends: 96 [2025-01-09 08:33:54,345 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 08:33:54,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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 08:33:54,350 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:33:54,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:33:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 08:33:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 08:33:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 08:33:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-01-09 08:33:54,374 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 98 [2025-01-09 08:33:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:33:54,374 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-01-09 08:33:54,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 08:33:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-01-09 08:33:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 08:33:54,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:33:54,377 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:54,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:33:54,577 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 08:33:54,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:33:54,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:33:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1977880507, now seen corresponding path program 1 times [2025-01-09 08:33:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:33:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569583375] [2025-01-09 08:33:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:33:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:33:54,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:33:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:33:54,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:33:54,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:33:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:33:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:33:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569583375] [2025-01-09 08:33:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569583375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:33:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:33:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:33:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414773904] [2025-01-09 08:33:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:33:54,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:33:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:33:54,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:33:54,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:33:54,717 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:33:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:33:54,769 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2025-01-09 08:33:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:33:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-01-09 08:33:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:33:54,774 INFO L225 Difference]: With dead ends: 137 [2025-01-09 08:33:54,774 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 08:33:54,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:33:54,776 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:33:54,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:33:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 08:33:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-01-09 08:33:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 08:33:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2025-01-09 08:33:54,803 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 98 [2025-01-09 08:33:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:33:54,804 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2025-01-09 08:33:54,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:33:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2025-01-09 08:33:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 08:33:54,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:33:54,805 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:54,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:33:54,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:33:54,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:33:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1924059779, now seen corresponding path program 1 times [2025-01-09 08:33:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:33:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-01-09 08:33:54,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:33:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:33:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:33:54,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:33:54,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:33:54,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:33:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:33:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:33:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-01-09 08:33:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309618367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:33:55,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:33:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:33:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298553685] [2025-01-09 08:33:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:33:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:33:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:33:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:33:55,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:33:55,071 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:33:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:33:55,205 INFO L93 Difference]: Finished difference Result 236 states and 349 transitions. [2025-01-09 08:33:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:33:55,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-01-09 08:33:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:33:55,208 INFO L225 Difference]: With dead ends: 236 [2025-01-09 08:33:55,208 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 08:33:55,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:33:55,209 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 58 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:33:55,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 253 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:33:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 08:33:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 124. [2025-01-09 08:33:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 08:33:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2025-01-09 08:33:55,226 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 98 [2025-01-09 08:33:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:33:55,227 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2025-01-09 08:33:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:33:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2025-01-09 08:33:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 08:33:55,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:33:55,228 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:33:55,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:33:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:33:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1244001409, now seen corresponding path program 1 times [2025-01-09 08:33:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:33:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322857756] [2025-01-09 08:33:55,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:33:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:33:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:33:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:33:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:33:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322857756] [2025-01-09 08:34:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322857756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:34:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107293853] [2025-01-09 08:34:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:34:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:34:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:34:01,991 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:03,370 INFO L93 Difference]: Finished difference Result 271 states and 392 transitions. [2025-01-09 08:34:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:34:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-01-09 08:34:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:03,372 INFO L225 Difference]: With dead ends: 271 [2025-01-09 08:34:03,372 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 08:34:03,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:34:03,373 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:03,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 311 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 08:34:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 08:34:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 141. [2025-01-09 08:34:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 08:34:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-01-09 08:34:03,392 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 98 [2025-01-09 08:34:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:03,393 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-01-09 08:34:03,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-01-09 08:34:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 08:34:03,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:03,395 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:03,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:34:03,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:03,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -743462525, now seen corresponding path program 1 times [2025-01-09 08:34:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108917793] [2025-01-09 08:34:03,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:03,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:34:03,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:34:03,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:03,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108917793] [2025-01-09 08:34:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108917793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:34:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646164436] [2025-01-09 08:34:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:10,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:34:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:10,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:34:10,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:34:10,651 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:14,588 INFO L93 Difference]: Finished difference Result 194 states and 269 transitions. [2025-01-09 08:34:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:34:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 08:34:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:14,592 INFO L225 Difference]: With dead ends: 194 [2025-01-09 08:34:14,593 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 08:34:14,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:34:14,593 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:14,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 323 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 08:34:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 08:34:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2025-01-09 08:34:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 102 states have internal predecessors, (132), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 08:34:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 222 transitions. [2025-01-09 08:34:14,617 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 222 transitions. Word has length 99 [2025-01-09 08:34:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:14,617 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 222 transitions. [2025-01-09 08:34:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 222 transitions. [2025-01-09 08:34:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 08:34:14,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:14,620 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:34:14,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 144163775, now seen corresponding path program 1 times [2025-01-09 08:34:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016766960] [2025-01-09 08:34:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:34:14,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:34:14,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:14,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016766960] [2025-01-09 08:34:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016766960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:21,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:21,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:34:21,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896118416] [2025-01-09 08:34:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:21,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:34:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:34:21,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:34:21,885 INFO L87 Difference]: Start difference. First operand 151 states and 222 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:28,992 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2025-01-09 08:34:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:34:28,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 08:34:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:28,997 INFO L225 Difference]: With dead ends: 192 [2025-01-09 08:34:28,997 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 08:34:28,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:34:28,998 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 94 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:28,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 321 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:34:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 08:34:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 152. [2025-01-09 08:34:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 103 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 08:34:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 223 transitions. [2025-01-09 08:34:29,019 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 223 transitions. Word has length 99 [2025-01-09 08:34:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:29,019 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 223 transitions. [2025-01-09 08:34:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 223 transitions. [2025-01-09 08:34:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 08:34:29,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:29,020 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:29,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:34:29,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:29,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:29,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1742778626, now seen corresponding path program 1 times [2025-01-09 08:34:29,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:29,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370063717] [2025-01-09 08:34:29,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:29,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:34:29,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:34:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370063717] [2025-01-09 08:34:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370063717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:34:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298314084] [2025-01-09 08:34:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:34:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:31,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:34:31,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:34:31,056 INFO L87 Difference]: Start difference. First operand 152 states and 223 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:34:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:33,176 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2025-01-09 08:34:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:34:33,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2025-01-09 08:34:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:33,179 INFO L225 Difference]: With dead ends: 192 [2025-01-09 08:34:33,179 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 08:34:33,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:34:33,181 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 266 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:33,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 253 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 08:34:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 08:34:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2025-01-09 08:34:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 08:34:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2025-01-09 08:34:33,199 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 99 [2025-01-09 08:34:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:33,200 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2025-01-09 08:34:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:34:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2025-01-09 08:34:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 08:34:33,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:33,201 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:34:33,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2144100390, now seen corresponding path program 1 times [2025-01-09 08:34:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:33,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 08:34:33,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:34:33,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:34:33,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:33,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:33,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 08:34:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793859987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:34:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413658833] [2025-01-09 08:34:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:34:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:33,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:34:33,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:34:33,286 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:33,351 INFO L93 Difference]: Finished difference Result 348 states and 505 transitions. [2025-01-09 08:34:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:34:33,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 08:34:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:33,354 INFO L225 Difference]: With dead ends: 348 [2025-01-09 08:34:33,354 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 08:34:33,354 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 08:34:33,355 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 67 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:33,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:34:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 08:34:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 205. [2025-01-09 08:34:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 08:34:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2025-01-09 08:34:33,381 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 99 [2025-01-09 08:34:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:33,381 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2025-01-09 08:34:33,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2025-01-09 08:34:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:34:33,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:33,382 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:34:33,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:33,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1517152963, now seen corresponding path program 1 times [2025-01-09 08:34:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-01-09 08:34:33,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:34:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:34:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:33,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-01-09 08:34:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408536946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:34:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534437312] [2025-01-09 08:34:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:34:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:42,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:34:42,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:34:42,268 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:34:51,566 INFO L93 Difference]: Finished difference Result 274 states and 380 transitions. [2025-01-09 08:34:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 08:34:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-01-09 08:34:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:34:51,572 INFO L225 Difference]: With dead ends: 274 [2025-01-09 08:34:51,573 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 08:34:51,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:34:51,573 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:34:51,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 317 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 08:34:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 08:34:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2025-01-09 08:34:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 08:34:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2025-01-09 08:34:51,598 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 100 [2025-01-09 08:34:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:34:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2025-01-09 08:34:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:34:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2025-01-09 08:34:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:34:51,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:34:51,601 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:51,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:34:51,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:34:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:34:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 79614846, now seen corresponding path program 1 times [2025-01-09 08:34:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:34:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761300547] [2025-01-09 08:34:51,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:34:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:34:51,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:34:51,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:34:51,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:34:51,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:34:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:34:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:34:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761300547] [2025-01-09 08:34:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761300547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:34:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:34:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 08:34:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358156721] [2025-01-09 08:34:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:34:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:34:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:34:59,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:34:59,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:34:59,752 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:35:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:35:07,204 INFO L93 Difference]: Finished difference Result 274 states and 380 transitions. [2025-01-09 08:35:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:35:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2025-01-09 08:35:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:35:07,210 INFO L225 Difference]: With dead ends: 274 [2025-01-09 08:35:07,210 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 08:35:07,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:35:07,212 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 235 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:35:07,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 232 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 08:35:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 08:35:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 211. [2025-01-09 08:35:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 146 states have (on average 1.2876712328767124) internal successors, (188), 146 states have internal predecessors, (188), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 08:35:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 308 transitions. [2025-01-09 08:35:07,241 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 308 transitions. Word has length 100 [2025-01-09 08:35:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:35:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 308 transitions. [2025-01-09 08:35:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:35:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 308 transitions. [2025-01-09 08:35:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:35:07,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:35:07,245 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:35:07,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:35:07,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:35:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1754935652, now seen corresponding path program 1 times [2025-01-09 08:35:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:35:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856303455] [2025-01-09 08:35:07,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:35:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:35:07,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:35:07,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:35:07,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:35:07,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:35:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:35:11,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:35:11,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856303455] [2025-01-09 08:35:11,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856303455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:35:11,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:35:11,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 08:35:11,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118964335] [2025-01-09 08:35:11,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:35:11,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:35:11,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:35:11,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:35:11,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:35:11,686 INFO L87 Difference]: Start difference. First operand 211 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:35:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:35:15,275 INFO L93 Difference]: Finished difference Result 259 states and 363 transitions. [2025-01-09 08:35:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:35:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2025-01-09 08:35:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:35:15,281 INFO L225 Difference]: With dead ends: 259 [2025-01-09 08:35:15,281 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 08:35:15,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:35:15,281 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 230 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:35:15,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 325 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 08:35:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 08:35:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 210. [2025-01-09 08:35:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 08:35:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2025-01-09 08:35:15,295 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 100 [2025-01-09 08:35:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:35:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2025-01-09 08:35:15,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 08:35:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2025-01-09 08:35:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:35:15,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:35:15,296 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:15,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:35:15,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:35:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:35:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1676405574, now seen corresponding path program 1 times [2025-01-09 08:35:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:35:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102358772] [2025-01-09 08:35:15,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:35:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:35:15,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:35:15,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:35:15,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:35:15,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:35:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 08:35:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:35:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102358772] [2025-01-09 08:35:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102358772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:35:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:35:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:35:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767066122] [2025-01-09 08:35:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:35:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:35:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:35:23,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:35:23,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:35:23,013 INFO L87 Difference]: Start difference. First operand 210 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:35:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:35:26,575 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2025-01-09 08:35:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:35:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-01-09 08:35:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:35:26,577 INFO L225 Difference]: With dead ends: 306 [2025-01-09 08:35:26,577 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 08:35:26,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:35:26,578 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 80 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:35:26,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 341 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 08:35:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 08:35:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 220. [2025-01-09 08:35:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 155 states have (on average 1.303225806451613) internal successors, (202), 155 states have internal predecessors, (202), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 08:35:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2025-01-09 08:35:26,608 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 100 [2025-01-09 08:35:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:35:26,608 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2025-01-09 08:35:26,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 08:35:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2025-01-09 08:35:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 08:35:26,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:35:26,609 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:26,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:35:26,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:35:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:35:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1771558238, now seen corresponding path program 1 times [2025-01-09 08:35:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:35:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345060996] [2025-01-09 08:35:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:35:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:35:26,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 08:35:26,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 08:35:26,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:35:26,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat