./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.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 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:28:28,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:28:28,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:28:28,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:28:28,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:28:28,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:28:28,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:28:28,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:28:28,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:28:28,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:28:28,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:28:28,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:28:28,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:28:28,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:28:28,320 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:28:28,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:28:28,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:28:28,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:28:28,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:28:28,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:28,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:28,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:28:28,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:28:28,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:28:28,323 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 -> 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b [2025-01-09 10:28:28,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:28:28,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:28:28,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:28:28,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:28:28,668 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:28:28,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-01-09 10:28:29,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330c09289/50a3cc2fc5e34304b893de76c7a0a38b/FLAG4ad8a5edc [2025-01-09 10:28:30,164 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:28:30,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-01-09 10:28:30,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330c09289/50a3cc2fc5e34304b893de76c7a0a38b/FLAG4ad8a5edc [2025-01-09 10:28:30,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330c09289/50a3cc2fc5e34304b893de76c7a0a38b [2025-01-09 10:28:30,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:28:30,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:28:30,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:30,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:28:30,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:28:30,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30, skipping insertion in model container [2025-01-09 10:28:30,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:28:30,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i[919,932] [2025-01-09 10:28:30,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:30,387 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:28:30,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i[919,932] [2025-01-09 10:28:30,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:30,453 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:28:30,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30 WrapperNode [2025-01-09 10:28:30,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:30,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:30,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:28:30,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:28:30,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,511 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-01-09 10:28:30,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:30,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:28:30,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:28:30,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:28:30,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:28:30,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:28:30,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:28:30,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:28:30,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:28:30,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (1/1) ... [2025-01-09 10:28:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:30,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:28:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:28:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:28:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:28:30,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:28:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:28:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:28:30,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:28:30,700 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:28:30,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:28:30,976 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 10:28:30,976 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:28:30,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:28:30,983 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:28:30,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:28:30 BoogieIcfgContainer [2025-01-09 10:28:30,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:28:30,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:28:30,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:28:30,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:28:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:28:30" (1/3) ... [2025-01-09 10:28:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7985e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:28:30, skipping insertion in model container [2025-01-09 10:28:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:30" (2/3) ... [2025-01-09 10:28:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7985e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:28:30, skipping insertion in model container [2025-01-09 10:28:30,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:28:30" (3/3) ... [2025-01-09 10:28:30,990 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-01-09 10:28:31,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:28:31,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:28:31,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:28:31,042 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;@553dc1ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:28:31,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:28:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 10:28:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 10:28:31,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:31,052 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:31,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:31,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1959681815, now seen corresponding path program 1 times [2025-01-09 10:28:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391636398] [2025-01-09 10:28:31,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 10:28:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 10:28:31,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:31,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 10:28:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391636398] [2025-01-09 10:28:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391636398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737030824] [2025-01-09 10:28:31,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:31,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:31,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:31,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:28:31,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:28:31,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 10:28:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 10:28:31,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:31,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:31,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:28:31,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 10:28:31,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:28:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737030824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:28:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:28:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082445281] [2025-01-09 10:28:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:28:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:31,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:28:31,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:28:31,549 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 10:28:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:31,570 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-01-09 10:28:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:28:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 125 [2025-01-09 10:28:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:31,577 INFO L225 Difference]: With dead ends: 152 [2025-01-09 10:28:31,579 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 10:28:31,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:28:31,588 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:31,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 10:28:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 10:28:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 10:28:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-01-09 10:28:31,622 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 125 [2025-01-09 10:28:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:31,622 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-01-09 10:28:31,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 10:28:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-01-09 10:28:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 10:28:31,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:31,629 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:31,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:28:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:28:31,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1489921873, now seen corresponding path program 1 times [2025-01-09 10:28:31,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:31,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107370663] [2025-01-09 10:28:31,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:31,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:31,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 10:28:31,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 10:28:31,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:31,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107370663] [2025-01-09 10:28:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107370663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513687391] [2025-01-09 10:28:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:32,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:32,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:32,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:32,176 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:32,389 INFO L93 Difference]: Finished difference Result 272 states and 416 transitions. [2025-01-09 10:28:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-01-09 10:28:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:32,392 INFO L225 Difference]: With dead ends: 272 [2025-01-09 10:28:32,393 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 10:28:32,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:32,395 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 137 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:32,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 330 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:28:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 10:28:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 147. [2025-01-09 10:28:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 110 states have internal predecessors, (158), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:28:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2025-01-09 10:28:32,420 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 125 [2025-01-09 10:28:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:32,421 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2025-01-09 10:28:32,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2025-01-09 10:28:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:32,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:32,423 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:28:32,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 846432073, now seen corresponding path program 1 times [2025-01-09 10:28:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230717820] [2025-01-09 10:28:32,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:32,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:32,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:32,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:32,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230717820] [2025-01-09 10:28:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230717820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:28:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136470113] [2025-01-09 10:28:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:28:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:32,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:28:32,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:28:32,581 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:32,636 INFO L93 Difference]: Finished difference Result 389 states and 594 transitions. [2025-01-09 10:28:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:28:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-01-09 10:28:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:32,640 INFO L225 Difference]: With dead ends: 389 [2025-01-09 10:28:32,642 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 10:28:32,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:28:32,643 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 72 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:32,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 10:28:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 153. [2025-01-09 10:28:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 116 states have internal predecessors, (165), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:28:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2025-01-09 10:28:32,661 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 126 [2025-01-09 10:28:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:32,662 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2025-01-09 10:28:32,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2025-01-09 10:28:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:32,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:32,664 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:32,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:28:32,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2077056539, now seen corresponding path program 1 times [2025-01-09 10:28:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270210016] [2025-01-09 10:28:32,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:32,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:32,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:32,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:32,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270210016] [2025-01-09 10:28:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270210016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:28:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705925301] [2025-01-09 10:28:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:28:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:32,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:28:32,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:32,879 INFO L87 Difference]: Start difference. First operand 153 states and 233 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:33,093 INFO L93 Difference]: Finished difference Result 486 states and 741 transitions. [2025-01-09 10:28:33,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:33,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-01-09 10:28:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:33,097 INFO L225 Difference]: With dead ends: 486 [2025-01-09 10:28:33,097 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 10:28:33,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:28:33,100 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 329 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 434 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:28:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 10:28:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 297. [2025-01-09 10:28:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:28:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 452 transitions. [2025-01-09 10:28:33,166 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 452 transitions. Word has length 126 [2025-01-09 10:28:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 452 transitions. [2025-01-09 10:28:33,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 452 transitions. [2025-01-09 10:28:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:33,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:33,173 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:28:33,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:33,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 412472423, now seen corresponding path program 1 times [2025-01-09 10:28:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82046631] [2025-01-09 10:28:33,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:33,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:33,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:33,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82046631] [2025-01-09 10:28:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82046631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988298646] [2025-01-09 10:28:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:33,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:33,465 INFO L87 Difference]: Start difference. First operand 297 states and 452 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:33,672 INFO L93 Difference]: Finished difference Result 885 states and 1350 transitions. [2025-01-09 10:28:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-01-09 10:28:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:33,680 INFO L225 Difference]: With dead ends: 885 [2025-01-09 10:28:33,680 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 10:28:33,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:33,682 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 174 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:33,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 413 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:28:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 10:28:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 303. [2025-01-09 10:28:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 230 states have (on average 1.4086956521739131) internal successors, (324), 230 states have internal predecessors, (324), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:28:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 460 transitions. [2025-01-09 10:28:33,726 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 460 transitions. Word has length 126 [2025-01-09 10:28:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 460 transitions. [2025-01-09 10:28:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 460 transitions. [2025-01-09 10:28:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:33,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:33,733 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:33,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:28:33,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:33,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1244929307, now seen corresponding path program 1 times [2025-01-09 10:28:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663593511] [2025-01-09 10:28:33,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:33,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:33,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:33,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:33,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:33,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663593511] [2025-01-09 10:28:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663593511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:33,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:28:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603694397] [2025-01-09 10:28:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:33,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:28:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:33,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:28:33,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:28:33,799 INFO L87 Difference]: Start difference. First operand 303 states and 460 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:33,866 INFO L93 Difference]: Finished difference Result 883 states and 1338 transitions. [2025-01-09 10:28:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:28:33,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-01-09 10:28:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:33,872 INFO L225 Difference]: With dead ends: 883 [2025-01-09 10:28:33,872 INFO L226 Difference]: Without dead ends: 583 [2025-01-09 10:28:33,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:28:33,874 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 98 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:33,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 317 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-01-09 10:28:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 315. [2025-01-09 10:28:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 242 states have internal predecessors, (340), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:28:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 476 transitions. [2025-01-09 10:28:33,911 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 476 transitions. Word has length 126 [2025-01-09 10:28:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 476 transitions. [2025-01-09 10:28:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 476 transitions. [2025-01-09 10:28:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:33,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:33,913 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:33,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:28:33,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1244599655, now seen corresponding path program 1 times [2025-01-09 10:28:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898558862] [2025-01-09 10:28:33,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:33,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:33,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:33,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898558862] [2025-01-09 10:28:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898558862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:28:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439360886] [2025-01-09 10:28:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:34,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:28:34,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:34,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:28:34,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:28:34,508 INFO L87 Difference]: Start difference. First operand 315 states and 476 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 10:28:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:35,123 INFO L93 Difference]: Finished difference Result 887 states and 1340 transitions. [2025-01-09 10:28:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:28:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2025-01-09 10:28:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:35,127 INFO L225 Difference]: With dead ends: 887 [2025-01-09 10:28:35,127 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 10:28:35,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:28:35,129 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 306 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:35,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 839 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:28:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 10:28:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 415. [2025-01-09 10:28:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 324 states have (on average 1.404320987654321) internal successors, (455), 324 states have internal predecessors, (455), 85 states have call successors, (85), 5 states have call predecessors, (85), 5 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-01-09 10:28:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 625 transitions. [2025-01-09 10:28:35,170 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 625 transitions. Word has length 126 [2025-01-09 10:28:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:35,170 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 625 transitions. [2025-01-09 10:28:35,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 10:28:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 625 transitions. [2025-01-09 10:28:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:35,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:35,173 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:28:35,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:35,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash 474512037, now seen corresponding path program 1 times [2025-01-09 10:28:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-01-09 10:28:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:35,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:35,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:35,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:35,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-01-09 10:28:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196039145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:28:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694884333] [2025-01-09 10:28:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:28:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:28:35,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:28:35,368 INFO L87 Difference]: Start difference. First operand 415 states and 625 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 10:28:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:35,779 INFO L93 Difference]: Finished difference Result 1643 states and 2477 transitions. [2025-01-09 10:28:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:28:35,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-01-09 10:28:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:35,787 INFO L225 Difference]: With dead ends: 1643 [2025-01-09 10:28:35,787 INFO L226 Difference]: Without dead ends: 1331 [2025-01-09 10:28:35,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:28:35,789 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 641 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1128 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:28:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-01-09 10:28:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 975. [2025-01-09 10:28:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 812 states have (on average 1.4470443349753694) internal successors, (1175), 812 states have internal predecessors, (1175), 153 states have call successors, (153), 9 states have call predecessors, (153), 9 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-09 10:28:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1481 transitions. [2025-01-09 10:28:35,863 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1481 transitions. Word has length 126 [2025-01-09 10:28:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1481 transitions. [2025-01-09 10:28:35,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 10:28:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1481 transitions. [2025-01-09 10:28:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 10:28:35,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:35,865 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:28:35,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1306639269, now seen corresponding path program 1 times [2025-01-09 10:28:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181400841] [2025-01-09 10:28:35,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 10:28:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 10:28:35,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:35,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181400841] [2025-01-09 10:28:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181400841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:35,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:35,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:28:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042345152] [2025-01-09 10:28:35,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:28:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:35,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:28:35,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:35,958 INFO L87 Difference]: Start difference. First operand 975 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:36,074 INFO L93 Difference]: Finished difference Result 1275 states and 1934 transitions. [2025-01-09 10:28:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-01-09 10:28:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:36,078 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 10:28:36,078 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 10:28:36,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:28:36,081 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 144 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:36,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 174 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:28:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 10:28:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 261. [2025-01-09 10:28:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 206 states have internal predecessors, (284), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:28:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-01-09 10:28:36,103 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 126 [2025-01-09 10:28:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:36,103 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-01-09 10:28:36,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-01-09 10:28:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 10:28:36,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:36,104 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:36,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:28:36,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:36,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2109402998, now seen corresponding path program 1 times [2025-01-09 10:28:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624478084] [2025-01-09 10:28:36,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:36,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 10:28:36,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 10:28:36,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:36,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624478084] [2025-01-09 10:28:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624478084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:28:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126490596] [2025-01-09 10:28:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:28:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:36,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:28:36,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:28:36,618 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:36,983 INFO L93 Difference]: Finished difference Result 496 states and 728 transitions. [2025-01-09 10:28:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:28:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 127 [2025-01-09 10:28:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:36,986 INFO L225 Difference]: With dead ends: 496 [2025-01-09 10:28:36,987 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 10:28:36,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:28:36,988 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 239 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:36,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 764 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:28:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 10:28:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 238. [2025-01-09 10:28:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 183 states have (on average 1.360655737704918) internal successors, (249), 183 states have internal predecessors, (249), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:28:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 351 transitions. [2025-01-09 10:28:37,007 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 351 transitions. Word has length 127 [2025-01-09 10:28:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:37,008 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 351 transitions. [2025-01-09 10:28:37,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 351 transitions. [2025-01-09 10:28:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 10:28:37,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:37,010 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:28:37,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 705321309, now seen corresponding path program 1 times [2025-01-09 10:28:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553012998] [2025-01-09 10:28:37,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:37,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 10:28:37,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 10:28:37,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:37,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:37,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553012998] [2025-01-09 10:28:37,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553012998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:37,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:37,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:28:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276816405] [2025-01-09 10:28:37,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:28:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:37,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:28:37,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:37,464 INFO L87 Difference]: Start difference. First operand 238 states and 351 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:37,735 INFO L93 Difference]: Finished difference Result 545 states and 787 transitions. [2025-01-09 10:28:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:28:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-01-09 10:28:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:37,740 INFO L225 Difference]: With dead ends: 545 [2025-01-09 10:28:37,740 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 10:28:37,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:28:37,741 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 173 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:37,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 337 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:28:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 10:28:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2025-01-09 10:28:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 291 states have (on average 1.3436426116838487) internal successors, (391), 293 states have internal predecessors, (391), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 10:28:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 525 transitions. [2025-01-09 10:28:37,784 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 525 transitions. Word has length 128 [2025-01-09 10:28:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:37,785 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 525 transitions. [2025-01-09 10:28:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 10:28:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 525 transitions. [2025-01-09 10:28:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 10:28:37,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:37,787 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:28:37,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:37,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash 379173079, now seen corresponding path program 1 times [2025-01-09 10:28:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140390656] [2025-01-09 10:28:37,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:37,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 10:28:37,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 10:28:37,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140390656] [2025-01-09 10:28:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140390656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:28:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220506654] [2025-01-09 10:28:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:38,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:28:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:38,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:28:38,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:28:38,500 INFO L87 Difference]: Start difference. First operand 369 states and 525 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:38,961 INFO L93 Difference]: Finished difference Result 715 states and 1018 transitions. [2025-01-09 10:28:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:28:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-01-09 10:28:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:38,965 INFO L225 Difference]: With dead ends: 715 [2025-01-09 10:28:38,965 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 10:28:38,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:28:38,966 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 280 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:38,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 562 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:28:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 10:28:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 381. [2025-01-09 10:28:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 303 states have (on average 1.3498349834983498) internal successors, (409), 305 states have internal predecessors, (409), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 10:28:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 543 transitions. [2025-01-09 10:28:38,994 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 543 transitions. Word has length 129 [2025-01-09 10:28:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:38,994 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 543 transitions. [2025-01-09 10:28:38,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 543 transitions. [2025-01-09 10:28:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 10:28:38,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:38,995 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:38,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:28:38,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:38,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash -641895275, now seen corresponding path program 1 times [2025-01-09 10:28:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:38,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134569595] [2025-01-09 10:28:38,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:39,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 10:28:39,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 10:28:39,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:39,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 10:28:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134569595] [2025-01-09 10:28:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134569595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:28:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268046794] [2025-01-09 10:28:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:28:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:40,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:28:40,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:28:40,892 INFO L87 Difference]: Start difference. First operand 381 states and 543 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:42,436 INFO L93 Difference]: Finished difference Result 838 states and 1183 transitions. [2025-01-09 10:28:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:28:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-01-09 10:28:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:42,440 INFO L225 Difference]: With dead ends: 838 [2025-01-09 10:28:42,440 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 10:28:42,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:28:42,442 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 442 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:42,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 613 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:28:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 10:28:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 394. [2025-01-09 10:28:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 316 states have (on average 1.3512658227848102) internal successors, (427), 318 states have internal predecessors, (427), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 10:28:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 561 transitions. [2025-01-09 10:28:42,467 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 561 transitions. Word has length 129 [2025-01-09 10:28:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:42,467 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 561 transitions. [2025-01-09 10:28:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 10:28:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 561 transitions. [2025-01-09 10:28:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 10:28:42,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:42,469 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:42,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:28:42,470 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:42,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1290759275, now seen corresponding path program 1 times [2025-01-09 10:28:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:42,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326407242] [2025-01-09 10:28:42,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:42,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 10:28:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 10:28:42,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:42,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat