./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fab5880c6add66d25f9dda30d1a24e14051ec77fdefc3f83f67a5e43bacfe3df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:04:29,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:04:29,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:04:29,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:04:29,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:04:29,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:04:29,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:04:29,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:04:29,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:04:29,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:04:29,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:04:29,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:04:29,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:04:29,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:04:29,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:04:29,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:04:29,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:29,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:29,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:29,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:04:29,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:04:29,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:04:29,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:04:29,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:04:29,431 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 -> fab5880c6add66d25f9dda30d1a24e14051ec77fdefc3f83f67a5e43bacfe3df [2025-01-09 12:04:29,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:04:29,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:04:29,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:04:29,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:04:29,693 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:04:29,694 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-ps-co_file-34.i [2025-01-09 12:04:31,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fe6702ed/457a91d1d2fb4df9a2df33e0a0a80d23/FLAG6bf301b99 [2025-01-09 12:04:31,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:04:31,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-34.i [2025-01-09 12:04:31,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fe6702ed/457a91d1d2fb4df9a2df33e0a0a80d23/FLAG6bf301b99 [2025-01-09 12:04:31,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fe6702ed/457a91d1d2fb4df9a2df33e0a0a80d23 [2025-01-09 12:04:31,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:04:31,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:04:31,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:31,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:04:31,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:04:31,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba935ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31, skipping insertion in model container [2025-01-09 12:04:31,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:04:31,766 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-ps-co_file-34.i[919,932] [2025-01-09 12:04:31,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:31,822 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:04:31,831 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-ps-co_file-34.i[919,932] [2025-01-09 12:04:31,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:31,872 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:04:31,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31 WrapperNode [2025-01-09 12:04:31,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:31,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:31,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:04:31,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:04:31,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,910 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-01-09 12:04:31,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:31,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:04:31,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:04:31,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:04:31,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,934 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:04:31,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:04:31,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:04:31,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:04:31,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:04:31,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (1/1) ... [2025-01-09 12:04:31,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:31,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:04:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:04:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:04:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:04:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:04:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:04:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:04:32,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:04:32,089 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:04:32,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:04:32,481 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 12:04:32,481 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:04:32,489 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:04:32,490 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:04:32,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:32 BoogieIcfgContainer [2025-01-09 12:04:32,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:04:32,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:04:32,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:04:32,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:04:32,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:04:31" (1/3) ... [2025-01-09 12:04:32,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126a5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:32, skipping insertion in model container [2025-01-09 12:04:32,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:31" (2/3) ... [2025-01-09 12:04:32,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126a5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:32, skipping insertion in model container [2025-01-09 12:04:32,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:32" (3/3) ... [2025-01-09 12:04:32,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-34.i [2025-01-09 12:04:32,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:04:32,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-34.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:04:32,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:04:32,559 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;@6970f697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:04:32,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:04:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:04:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 12:04:32,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:32,573 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:32,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:32,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -233337513, now seen corresponding path program 1 times [2025-01-09 12:04:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:32,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140817781] [2025-01-09 12:04:32,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:32,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 12:04:32,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 12:04:32,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:32,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 12:04:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140817781] [2025-01-09 12:04:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140817781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:04:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283961863] [2025-01-09 12:04:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:32,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:04:32,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:04:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 12:04:32,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 12:04:32,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:32,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:32,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:04:32,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:04:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 12:04:33,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:04:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283961863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:33,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:04:33,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:04:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972113921] [2025-01-09 12:04:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:04:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:33,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:04:33,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:04:33,045 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:04:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:33,076 INFO L93 Difference]: Finished difference Result 198 states and 344 transitions. [2025-01-09 12:04:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:04:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 179 [2025-01-09 12:04:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:33,084 INFO L225 Difference]: With dead ends: 198 [2025-01-09 12:04:33,084 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 12:04:33,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:04:33,090 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:33,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 12:04:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 12:04:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:04:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-01-09 12:04:33,137 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 179 [2025-01-09 12:04:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:33,138 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-01-09 12:04:33,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:04:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-01-09 12:04:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 12:04:33,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:33,143 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:33,153 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 12:04:33,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:04:33,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:33,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 309910493, now seen corresponding path program 1 times [2025-01-09 12:04:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869620968] [2025-01-09 12:04:33,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:33,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 12:04:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 12:04:33,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:33,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869620968] [2025-01-09 12:04:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869620968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966361591] [2025-01-09 12:04:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:33,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:33,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:33,922 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:34,124 INFO L93 Difference]: Finished difference Result 321 states and 507 transitions. [2025-01-09 12:04:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 12:04:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:34,134 INFO L225 Difference]: With dead ends: 321 [2025-01-09 12:04:34,134 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 12:04:34,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:34,135 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 168 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:34,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 486 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 12:04:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 195. [2025-01-09 12:04:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 138 states have (on average 1.4565217391304348) internal successors, (201), 138 states have internal predecessors, (201), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 12:04:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 309 transitions. [2025-01-09 12:04:34,179 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 309 transitions. Word has length 179 [2025-01-09 12:04:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:34,179 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 309 transitions. [2025-01-09 12:04:34,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 309 transitions. [2025-01-09 12:04:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 12:04:34,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:34,182 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:34,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:04:34,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 157033789, now seen corresponding path program 1 times [2025-01-09 12:04:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:34,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063255085] [2025-01-09 12:04:34,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:34,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 12:04:34,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 12:04:34,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:34,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063255085] [2025-01-09 12:04:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063255085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:34,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:04:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37519780] [2025-01-09 12:04:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:34,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:04:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:34,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:04:34,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:34,634 INFO L87 Difference]: Start difference. First operand 195 states and 309 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:34,996 INFO L93 Difference]: Finished difference Result 574 states and 910 transitions. [2025-01-09 12:04:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:04:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-01-09 12:04:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:35,002 INFO L225 Difference]: With dead ends: 574 [2025-01-09 12:04:35,005 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 12:04:35,011 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 12:04:35,011 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 206 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:35,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 462 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:04:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 12:04:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 199. [2025-01-09 12:04:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.443661971830986) internal successors, (205), 142 states have internal predecessors, (205), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 12:04:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2025-01-09 12:04:35,074 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 180 [2025-01-09 12:04:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:35,074 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2025-01-09 12:04:35,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2025-01-09 12:04:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:35,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:35,081 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:04:35,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 662768517, now seen corresponding path program 1 times [2025-01-09 12:04:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990982397] [2025-01-09 12:04:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:35,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:35,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:35,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:35,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990982397] [2025-01-09 12:04:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990982397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777457991] [2025-01-09 12:04:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:35,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:35,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:35,715 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:35,811 INFO L93 Difference]: Finished difference Result 587 states and 927 transitions. [2025-01-09 12:04:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:35,814 INFO L225 Difference]: With dead ends: 587 [2025-01-09 12:04:35,814 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 12:04:35,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:04:35,815 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 101 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:35,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 12:04:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2025-01-09 12:04:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 272 states have (on average 1.4338235294117647) internal successors, (390), 272 states have internal predecessors, (390), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:04:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 606 transitions. [2025-01-09 12:04:35,859 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 606 transitions. Word has length 181 [2025-01-09 12:04:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:35,860 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 606 transitions. [2025-01-09 12:04:35,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 606 transitions. [2025-01-09 12:04:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:35,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:35,862 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:35,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:04:35,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 796782023, now seen corresponding path program 1 times [2025-01-09 12:04:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614954240] [2025-01-09 12:04:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:35,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:35,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:35,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:42,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614954240] [2025-01-09 12:04:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614954240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:04:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657042922] [2025-01-09 12:04:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:04:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:04:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:04:42,075 INFO L87 Difference]: Start difference. First operand 385 states and 606 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:44,112 INFO L93 Difference]: Finished difference Result 1165 states and 1784 transitions. [2025-01-09 12:04:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:04:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:44,125 INFO L225 Difference]: With dead ends: 1165 [2025-01-09 12:04:44,125 INFO L226 Difference]: Without dead ends: 783 [2025-01-09 12:04:44,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:04:44,131 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 523 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:44,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 708 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:04:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-01-09 12:04:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 547. [2025-01-09 12:04:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 406 states have (on average 1.4334975369458127) internal successors, (582), 406 states have internal predecessors, (582), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 852 transitions. [2025-01-09 12:04:44,203 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 852 transitions. Word has length 181 [2025-01-09 12:04:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:44,205 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 852 transitions. [2025-01-09 12:04:44,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 852 transitions. [2025-01-09 12:04:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:44,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:44,208 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:04:44,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1723177911, now seen corresponding path program 1 times [2025-01-09 12:04:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635958812] [2025-01-09 12:04:44,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:44,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:44,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:44,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:44,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:46,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635958812] [2025-01-09 12:04:46,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635958812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:46,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:46,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:04:46,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115050477] [2025-01-09 12:04:46,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:46,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:04:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:46,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:04:46,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:04:46,184 INFO L87 Difference]: Start difference. First operand 547 states and 852 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:47,186 INFO L93 Difference]: Finished difference Result 1214 states and 1875 transitions. [2025-01-09 12:04:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:04:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:47,201 INFO L225 Difference]: With dead ends: 1214 [2025-01-09 12:04:47,201 INFO L226 Difference]: Without dead ends: 816 [2025-01-09 12:04:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:04:47,203 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 395 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:47,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 543 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:04:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-01-09 12:04:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 592. [2025-01-09 12:04:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 451 states have (on average 1.4301552106430155) internal successors, (645), 451 states have internal predecessors, (645), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 915 transitions. [2025-01-09 12:04:47,265 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 915 transitions. Word has length 181 [2025-01-09 12:04:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 915 transitions. [2025-01-09 12:04:47,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 915 transitions. [2025-01-09 12:04:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:47,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:47,268 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:47,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:04:47,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:47,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1476840393, now seen corresponding path program 1 times [2025-01-09 12:04:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487847134] [2025-01-09 12:04:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:49,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487847134] [2025-01-09 12:04:49,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487847134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:49,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:04:49,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071143978] [2025-01-09 12:04:49,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:49,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:04:49,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:49,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:04:49,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:04:49,028 INFO L87 Difference]: Start difference. First operand 592 states and 915 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:49,994 INFO L93 Difference]: Finished difference Result 982 states and 1496 transitions. [2025-01-09 12:04:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:04:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:49,998 INFO L225 Difference]: With dead ends: 982 [2025-01-09 12:04:49,998 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 12:04:49,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:04:50,000 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 314 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:50,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 548 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:04:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 12:04:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 624. [2025-01-09 12:04:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 483 states have (on average 1.4472049689440993) internal successors, (699), 483 states have internal predecessors, (699), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 969 transitions. [2025-01-09 12:04:50,048 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 969 transitions. Word has length 181 [2025-01-09 12:04:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:50,048 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 969 transitions. [2025-01-09 12:04:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 969 transitions. [2025-01-09 12:04:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:50,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:50,052 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:50,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:04:50,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -473351048, now seen corresponding path program 1 times [2025-01-09 12:04:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371393922] [2025-01-09 12:04:50,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:50,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371393922] [2025-01-09 12:04:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371393922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:51,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:04:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711230210] [2025-01-09 12:04:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:04:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:51,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:04:51,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:04:51,261 INFO L87 Difference]: Start difference. First operand 624 states and 969 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:51,705 INFO L93 Difference]: Finished difference Result 1036 states and 1585 transitions. [2025-01-09 12:04:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:04:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:51,710 INFO L225 Difference]: With dead ends: 1036 [2025-01-09 12:04:51,711 INFO L226 Difference]: Without dead ends: 794 [2025-01-09 12:04:51,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:04:51,712 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 207 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:51,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 468 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:04:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-01-09 12:04:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 630. [2025-01-09 12:04:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 489 states have (on average 1.4376278118609407) internal successors, (703), 489 states have internal predecessors, (703), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2025-01-09 12:04:51,780 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 181 [2025-01-09 12:04:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:51,781 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2025-01-09 12:04:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2025-01-09 12:04:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:04:51,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:51,786 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:51,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:04:51,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -214335227, now seen corresponding path program 1 times [2025-01-09 12:04:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076621195] [2025-01-09 12:04:51,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:51,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:04:51,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:04:51,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:51,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076621195] [2025-01-09 12:04:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076621195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649375795] [2025-01-09 12:04:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:52,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:52,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:52,101 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:52,437 INFO L93 Difference]: Finished difference Result 1114 states and 1723 transitions. [2025-01-09 12:04:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 12:04:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:52,442 INFO L225 Difference]: With dead ends: 1114 [2025-01-09 12:04:52,442 INFO L226 Difference]: Without dead ends: 644 [2025-01-09 12:04:52,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:52,446 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 118 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:52,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 377 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:04:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-09 12:04:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 590. [2025-01-09 12:04:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 449 states have (on average 1.4142538975501113) internal successors, (635), 449 states have internal predecessors, (635), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 905 transitions. [2025-01-09 12:04:52,489 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 905 transitions. Word has length 181 [2025-01-09 12:04:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 905 transitions. [2025-01-09 12:04:52,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 905 transitions. [2025-01-09 12:04:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 12:04:52,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:52,493 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:52,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:04:52,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1659768644, now seen corresponding path program 1 times [2025-01-09 12:04:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824558359] [2025-01-09 12:04:52,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:52,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 12:04:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 12:04:52,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:52,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:04:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824558359] [2025-01-09 12:04:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824558359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:04:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280189217] [2025-01-09 12:04:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:54,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:04:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:54,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:04:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:04:54,969 INFO L87 Difference]: Start difference. First operand 590 states and 905 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:57,620 INFO L93 Difference]: Finished difference Result 1368 states and 2078 transitions. [2025-01-09 12:04:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:04:57,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 12:04:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:57,633 INFO L225 Difference]: With dead ends: 1368 [2025-01-09 12:04:57,634 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 12:04:57,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:04:57,640 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 433 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:57,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 607 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:04:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 12:04:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 691. [2025-01-09 12:04:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 550 states have (on average 1.4254545454545455) internal successors, (784), 550 states have internal predecessors, (784), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:04:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1054 transitions. [2025-01-09 12:04:57,748 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1054 transitions. Word has length 182 [2025-01-09 12:04:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1054 transitions. [2025-01-09 12:04:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:04:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1054 transitions. [2025-01-09 12:04:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 12:04:57,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:57,750 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:57,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:04:57,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1955140282, now seen corresponding path program 1 times [2025-01-09 12:04:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328606476] [2025-01-09 12:04:57,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 12:04:57,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 12:04:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328606476] [2025-01-09 12:05:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328606476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:05:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727427378] [2025-01-09 12:05:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:03,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:05:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:05:03,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:05:03,891 INFO L87 Difference]: Start difference. First operand 691 states and 1054 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:05,290 INFO L93 Difference]: Finished difference Result 1352 states and 2032 transitions. [2025-01-09 12:05:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:05:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 12:05:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:05,294 INFO L225 Difference]: With dead ends: 1352 [2025-01-09 12:05:05,295 INFO L226 Difference]: Without dead ends: 843 [2025-01-09 12:05:05,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:05:05,296 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 244 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:05,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 928 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:05:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-01-09 12:05:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 697. [2025-01-09 12:05:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 556 states have (on average 1.4262589928057554) internal successors, (793), 556 states have internal predecessors, (793), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1063 transitions. [2025-01-09 12:05:05,335 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1063 transitions. Word has length 182 [2025-01-09 12:05:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1063 transitions. [2025-01-09 12:05:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1063 transitions. [2025-01-09 12:05:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 12:05:05,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:05,337 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:05:05,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1800106800, now seen corresponding path program 1 times [2025-01-09 12:05:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708436998] [2025-01-09 12:05:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:05,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 12:05:05,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 12:05:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708436998] [2025-01-09 12:05:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708436998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:05:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596098604] [2025-01-09 12:05:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:05:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:07,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:05:07,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:05:07,447 INFO L87 Difference]: Start difference. First operand 697 states and 1063 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:08,545 INFO L93 Difference]: Finished difference Result 1207 states and 1810 transitions. [2025-01-09 12:05:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:05:08,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 182 [2025-01-09 12:05:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:08,553 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 12:05:08,553 INFO L226 Difference]: Without dead ends: 941 [2025-01-09 12:05:08,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:05:08,554 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 350 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:08,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 784 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:05:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-01-09 12:05:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 733. [2025-01-09 12:05:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 588 states have (on average 1.4098639455782314) internal successors, (829), 588 states have internal predecessors, (829), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1099 transitions. [2025-01-09 12:05:08,655 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1099 transitions. Word has length 182 [2025-01-09 12:05:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:08,655 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1099 transitions. [2025-01-09 12:05:08,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1099 transitions. [2025-01-09 12:05:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 12:05:08,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:08,656 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:05:08,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1416077444, now seen corresponding path program 1 times [2025-01-09 12:05:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17165740] [2025-01-09 12:05:08,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:08,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 12:05:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 12:05:08,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:08,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:11,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:11,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17165740] [2025-01-09 12:05:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17165740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:11,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:05:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164703838] [2025-01-09 12:05:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:11,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:05:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:11,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:05:11,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:05:11,950 INFO L87 Difference]: Start difference. First operand 733 states and 1099 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:16,375 INFO L93 Difference]: Finished difference Result 1395 states and 2064 transitions. [2025-01-09 12:05:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:05:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 12:05:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:16,381 INFO L225 Difference]: With dead ends: 1395 [2025-01-09 12:05:16,381 INFO L226 Difference]: Without dead ends: 1113 [2025-01-09 12:05:16,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:05:16,384 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 502 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:16,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 686 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 12:05:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-01-09 12:05:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 753. [2025-01-09 12:05:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 608 states have (on average 1.40625) internal successors, (855), 608 states have internal predecessors, (855), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1125 transitions. [2025-01-09 12:05:16,429 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1125 transitions. Word has length 183 [2025-01-09 12:05:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1125 transitions. [2025-01-09 12:05:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1125 transitions. [2025-01-09 12:05:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 12:05:16,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:16,431 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:16,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:05:16,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:16,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1103882490, now seen corresponding path program 1 times [2025-01-09 12:05:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170119937] [2025-01-09 12:05:16,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:16,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 12:05:16,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 12:05:16,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:16,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170119937] [2025-01-09 12:05:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170119937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:19,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:05:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912440696] [2025-01-09 12:05:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:05:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:19,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:05:19,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:05:19,451 INFO L87 Difference]: Start difference. First operand 753 states and 1125 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:23,668 INFO L93 Difference]: Finished difference Result 1569 states and 2326 transitions. [2025-01-09 12:05:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:05:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 12:05:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:23,672 INFO L225 Difference]: With dead ends: 1569 [2025-01-09 12:05:23,673 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 12:05:23,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:05:23,674 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 509 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:23,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 565 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:05:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 12:05:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 791. [2025-01-09 12:05:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 646 states have (on average 1.4040247678018576) internal successors, (907), 646 states have internal predecessors, (907), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1177 transitions. [2025-01-09 12:05:23,725 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1177 transitions. Word has length 183 [2025-01-09 12:05:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:23,726 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1177 transitions. [2025-01-09 12:05:23,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1177 transitions. [2025-01-09 12:05:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 12:05:23,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:23,727 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:05:23,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2096135814, now seen corresponding path program 1 times [2025-01-09 12:05:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78953770] [2025-01-09 12:05:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:23,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 12:05:23,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 12:05:23,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:23,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78953770] [2025-01-09 12:05:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78953770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:05:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514416484] [2025-01-09 12:05:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:27,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:05:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:05:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:05:27,120 INFO L87 Difference]: Start difference. First operand 791 states and 1177 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:29,866 INFO L93 Difference]: Finished difference Result 1886 states and 2759 transitions. [2025-01-09 12:05:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:05:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 12:05:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:29,871 INFO L225 Difference]: With dead ends: 1886 [2025-01-09 12:05:29,871 INFO L226 Difference]: Without dead ends: 1146 [2025-01-09 12:05:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:05:29,873 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 395 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:29,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 841 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 12:05:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-01-09 12:05:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 819. [2025-01-09 12:05:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 674 states have (on average 1.3946587537091988) internal successors, (940), 674 states have internal predecessors, (940), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1210 transitions. [2025-01-09 12:05:29,925 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1210 transitions. Word has length 183 [2025-01-09 12:05:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:29,926 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1210 transitions. [2025-01-09 12:05:29,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1210 transitions. [2025-01-09 12:05:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 12:05:29,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:29,927 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:29,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:05:29,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash -423824120, now seen corresponding path program 1 times [2025-01-09 12:05:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561398601] [2025-01-09 12:05:29,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:29,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 12:05:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 12:05:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561398601] [2025-01-09 12:05:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561398601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:05:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193060677] [2025-01-09 12:05:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:36,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:05:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:36,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:05:36,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:05:36,036 INFO L87 Difference]: Start difference. First operand 819 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:39,600 INFO L93 Difference]: Finished difference Result 1511 states and 2213 transitions. [2025-01-09 12:05:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:05:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 12:05:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:39,606 INFO L225 Difference]: With dead ends: 1511 [2025-01-09 12:05:39,606 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 12:05:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:05:39,609 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 318 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:39,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 756 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:05:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 12:05:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 843. [2025-01-09 12:05:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 698 states have (on average 1.3839541547277936) internal successors, (966), 698 states have internal predecessors, (966), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1236 transitions. [2025-01-09 12:05:39,664 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1236 transitions. Word has length 183 [2025-01-09 12:05:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:39,664 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1236 transitions. [2025-01-09 12:05:39,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1236 transitions. [2025-01-09 12:05:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 12:05:39,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:39,666 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:39,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:05:39,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 120952402, now seen corresponding path program 1 times [2025-01-09 12:05:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014770268] [2025-01-09 12:05:39,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:39,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 12:05:39,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 12:05:39,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014770268] [2025-01-09 12:05:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014770268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:05:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346090658] [2025-01-09 12:05:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:46,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:05:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:46,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:05:46,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:05:46,662 INFO L87 Difference]: Start difference. First operand 843 states and 1236 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:48,534 INFO L93 Difference]: Finished difference Result 1291 states and 1867 transitions. [2025-01-09 12:05:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:05:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 183 [2025-01-09 12:05:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:48,541 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 12:05:48,541 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 12:05:48,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:05:48,543 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 365 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:48,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 721 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:05:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 12:05:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 833. [2025-01-09 12:05:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 688 states have (on average 1.3866279069767442) internal successors, (954), 688 states have internal predecessors, (954), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1224 transitions. [2025-01-09 12:05:48,594 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1224 transitions. Word has length 183 [2025-01-09 12:05:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1224 transitions. [2025-01-09 12:05:48,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1224 transitions. [2025-01-09 12:05:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 12:05:48,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:48,596 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:05:48,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 522407055, now seen corresponding path program 1 times [2025-01-09 12:05:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761505320] [2025-01-09 12:05:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:48,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 12:05:48,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 12:05:48,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:48,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:05:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:05:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761505320] [2025-01-09 12:05:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761505320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:50,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:05:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103380672] [2025-01-09 12:05:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:05:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:05:50,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:05:50,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:05:50,792 INFO L87 Difference]: Start difference. First operand 833 states and 1224 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:52,543 INFO L93 Difference]: Finished difference Result 1387 states and 2034 transitions. [2025-01-09 12:05:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 12:05:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 184 [2025-01-09 12:05:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:52,556 INFO L225 Difference]: With dead ends: 1387 [2025-01-09 12:05:52,556 INFO L226 Difference]: Without dead ends: 1081 [2025-01-09 12:05:52,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:05:52,557 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 219 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:52,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 933 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:05:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-01-09 12:05:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 823. [2025-01-09 12:05:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 678 states have (on average 1.3864306784660767) internal successors, (940), 678 states have internal predecessors, (940), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 12:05:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1210 transitions. [2025-01-09 12:05:52,665 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1210 transitions. Word has length 184 [2025-01-09 12:05:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1210 transitions. [2025-01-09 12:05:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:05:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1210 transitions. [2025-01-09 12:05:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 12:05:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:52,673 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:52,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 12:05:52,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1202465425, now seen corresponding path program 1 times [2025-01-09 12:05:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:05:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584941334] [2025-01-09 12:05:52,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:05:52,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 12:05:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 12:05:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat