./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.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 2907c9b5d215fd99a6a04cc6813259312414b8ebed955ba5e887662f96533409 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:39:02,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:39:02,509 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:39:02,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:39:02,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:39:02,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:39:02,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:39:02,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:39:02,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:39:02,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:39:02,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:39:02,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:39:02,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:39:02,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:39:02,536 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:39:02,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:39:02,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:39:02,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:02,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:02,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:02,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:39:02,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:39:02,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:39:02,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:39:02,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:39:02,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:39:02,539 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 -> 2907c9b5d215fd99a6a04cc6813259312414b8ebed955ba5e887662f96533409 [2025-01-09 12:39:02,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:39:02,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:39:02,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:39:02,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:39:02,772 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:39:02,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.i [2025-01-09 12:39:03,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be212ea5a/e854d615705f4e8da92b4c9774ae2947/FLAG72cc3d3c3 [2025-01-09 12:39:04,171 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:39:04,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.i [2025-01-09 12:39:04,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be212ea5a/e854d615705f4e8da92b4c9774ae2947/FLAG72cc3d3c3 [2025-01-09 12:39:04,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be212ea5a/e854d615705f4e8da92b4c9774ae2947 [2025-01-09 12:39:04,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:39:04,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:39:04,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:04,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:39:04,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:39:04,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eea268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04, skipping insertion in model container [2025-01-09 12:39:04,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:39:04,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.i[916,929] [2025-01-09 12:39:04,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:04,676 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:39:04,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-16.i[916,929] [2025-01-09 12:39:04,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:04,706 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:39:04,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04 WrapperNode [2025-01-09 12:39:04,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:04,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:04,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:39:04,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:39:04,716 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:39:04" (1/1) ... [2025-01-09 12:39:04,724 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:39:04" (1/1) ... [2025-01-09 12:39:04,751 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-01-09 12:39:04,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:04,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:39:04,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:39:04,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:39:04,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,767 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:39:04,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:39:04,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:39:04,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:39:04,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:39:04,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (1/1) ... [2025-01-09 12:39:04,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:04,805 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:39:04,808 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:39:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:39:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:39:04,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:39:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:39:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:39:04,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:39:04,871 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:39:04,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:39:05,029 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:39:05,029 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:39:05,040 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:39:05,042 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:39:05,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:05 BoogieIcfgContainer [2025-01-09 12:39:05,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:39:05,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:39:05,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:39:05,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:39:05,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:39:04" (1/3) ... [2025-01-09 12:39:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204ab6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:05, skipping insertion in model container [2025-01-09 12:39:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:04" (2/3) ... [2025-01-09 12:39:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204ab6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:05, skipping insertion in model container [2025-01-09 12:39:05,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:05" (3/3) ... [2025-01-09 12:39:05,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-16.i [2025-01-09 12:39:05,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:39:05,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-16.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:39:05,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:39:05,111 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;@3a8a8afb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:39:05,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:39:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:39:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:39:05,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:05,122 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -763676953, now seen corresponding path program 1 times [2025-01-09 12:39:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141492775] [2025-01-09 12:39:05,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:05,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:39:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:39:05,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:05,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:39:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141492775] [2025-01-09 12:39:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141492775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:39:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295940559] [2025-01-09 12:39:05,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:05,365 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:39:05,366 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:39:05,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:39:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:39:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:05,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:39:05,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:39:05,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:39:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295940559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:39:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:39:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663018320] [2025-01-09 12:39:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:39:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:05,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:39:05,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:05,536 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:39:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:05,551 INFO L93 Difference]: Finished difference Result 112 states and 196 transitions. [2025-01-09 12:39:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:39:05,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2025-01-09 12:39:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:05,557 INFO L225 Difference]: With dead ends: 112 [2025-01-09 12:39:05,557 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 12:39:05,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:39:05,561 INFO L435 NwaCegarLoop]: 84 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, 84 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:39:05,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 12:39:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 12:39:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:39:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2025-01-09 12:39:05,587 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 139 [2025-01-09 12:39:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:05,587 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2025-01-09 12:39:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:39:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2025-01-09 12:39:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:39:05,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:05,590 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,600 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:39:05,790 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:39:05,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:05,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:05,792 INFO L85 PathProgramCache]: Analyzing trace with hash -366967835, now seen corresponding path program 1 times [2025-01-09 12:39:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:05,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972841019] [2025-01-09 12:39:05,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:05,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:39:05,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:39:05,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:05,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972841019] [2025-01-09 12:39:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972841019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:39:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447052535] [2025-01-09 12:39:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:13,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:39:13,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:13,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:39:13,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:13,828 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:15,174 INFO L93 Difference]: Finished difference Result 88 states and 124 transitions. [2025-01-09 12:39:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:39:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:39:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:15,176 INFO L225 Difference]: With dead ends: 88 [2025-01-09 12:39:15,176 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 12:39:15,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:15,177 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:15,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 424 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:39:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 12:39:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2025-01-09 12:39:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:39:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-01-09 12:39:15,199 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 139 [2025-01-09 12:39:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:15,203 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-01-09 12:39:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-01-09 12:39:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:39:15,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:15,205 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:15,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:39:15,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:15,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1047026205, now seen corresponding path program 1 times [2025-01-09 12:39:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532485393] [2025-01-09 12:39:15,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:39:15,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:39:15,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532485393] [2025-01-09 12:39:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532485393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:39:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668328379] [2025-01-09 12:39:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:39:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:23,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:39:23,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:23,472 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:24,656 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-01-09 12:39:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:39:24,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:39:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:24,659 INFO L225 Difference]: With dead ends: 93 [2025-01-09 12:39:24,661 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 12:39:24,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:24,662 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:24,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 439 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:39:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 12:39:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2025-01-09 12:39:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:39:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2025-01-09 12:39:24,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 139 [2025-01-09 12:39:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:24,685 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2025-01-09 12:39:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2025-01-09 12:39:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:39:24,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:24,687 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:24,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:39:24,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1926216156, now seen corresponding path program 1 times [2025-01-09 12:39:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095971518] [2025-01-09 12:39:24,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:24,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:24,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:39:24,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:39:24,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:24,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095971518] [2025-01-09 12:39:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095971518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400311410] [2025-01-09 12:39:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:24,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:24,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:24,767 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:24,794 INFO L93 Difference]: Finished difference Result 139 states and 206 transitions. [2025-01-09 12:39:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:39:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:24,796 INFO L225 Difference]: With dead ends: 139 [2025-01-09 12:39:24,796 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 12:39:24,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:24,797 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:24,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 168 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 12:39:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-01-09 12:39:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 45 states have internal predecessors, (51), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:39:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2025-01-09 12:39:24,811 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 140 [2025-01-09 12:39:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:24,812 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2025-01-09 12:39:24,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2025-01-09 12:39:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:39:24,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:24,816 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:24,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:39:24,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:24,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash -151208794, now seen corresponding path program 1 times [2025-01-09 12:39:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:24,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701030400] [2025-01-09 12:39:24,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:24,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:39:24,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:39:24,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:33,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701030400] [2025-01-09 12:39:33,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701030400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:33,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:33,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:39:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072370173] [2025-01-09 12:39:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:39:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:33,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:39:33,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:33,190 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:34,136 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2025-01-09 12:39:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:39:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:39:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:34,139 INFO L225 Difference]: With dead ends: 115 [2025-01-09 12:39:34,139 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 12:39:34,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:34,140 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:34,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 434 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:39:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 12:39:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2025-01-09 12:39:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:39:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-01-09 12:39:34,147 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 140 [2025-01-09 12:39:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:34,147 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-01-09 12:39:34,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-01-09 12:39:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:39:34,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:34,149 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:34,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:39:34,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:34,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1125575350, now seen corresponding path program 1 times [2025-01-09 12:39:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379188442] [2025-01-09 12:39:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:34,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:39:34,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:39:34,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:34,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379188442] [2025-01-09 12:39:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379188442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:43,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:43,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:39:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503881528] [2025-01-09 12:39:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:43,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:39:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:43,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:39:43,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:43,001 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:45,024 INFO L93 Difference]: Finished difference Result 220 states and 314 transitions. [2025-01-09 12:39:45,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:39:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:39:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:45,031 INFO L225 Difference]: With dead ends: 220 [2025-01-09 12:39:45,031 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 12:39:45,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:39:45,033 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 66 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:45,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 358 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:39:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 12:39:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2025-01-09 12:39:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 83 states have internal predecessors, (95), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 207 transitions. [2025-01-09 12:39:45,045 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 207 transitions. Word has length 140 [2025-01-09 12:39:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:45,045 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 207 transitions. [2025-01-09 12:39:45,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2025-01-09 12:39:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:39:45,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:45,046 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:39:45,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 241818216, now seen corresponding path program 1 times [2025-01-09 12:39:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568293030] [2025-01-09 12:39:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:45,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:39:45,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:39:45,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:45,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:39:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568293030] [2025-01-09 12:39:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568293030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:53,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:39:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460902340] [2025-01-09 12:39:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:53,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:39:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:53,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:39:53,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:53,098 INFO L87 Difference]: Start difference. First operand 143 states and 207 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:54,260 INFO L93 Difference]: Finished difference Result 173 states and 242 transitions. [2025-01-09 12:39:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:39:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:39:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:54,262 INFO L225 Difference]: With dead ends: 173 [2025-01-09 12:39:54,262 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 12:39:54,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:54,263 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:54,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 434 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:39:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 12:39:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 138. [2025-01-09 12:39:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 78 states have internal predecessors, (88), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 200 transitions. [2025-01-09 12:39:54,286 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 200 transitions. Word has length 140 [2025-01-09 12:39:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:54,286 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 200 transitions. [2025-01-09 12:39:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:39:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2025-01-09 12:39:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:39:54,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:54,288 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:39:54,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1518602360, now seen corresponding path program 1 times [2025-01-09 12:39:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46255575] [2025-01-09 12:39:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:54,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:39:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:39:54,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:54,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:40:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46255575] [2025-01-09 12:40:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46255575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:40:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334749469] [2025-01-09 12:40:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:07,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:40:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:07,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:40:07,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:40:07,605 INFO L87 Difference]: Start difference. First operand 138 states and 200 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:09,117 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-01-09 12:40:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:40:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:40:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:09,118 INFO L225 Difference]: With dead ends: 176 [2025-01-09 12:40:09,119 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 12:40:09,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:40:09,119 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:09,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 524 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:40:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 12:40:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 143. [2025-01-09 12:40:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.170731707317073) internal successors, (96), 83 states have internal predecessors, (96), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:40:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-01-09 12:40:09,138 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 140 [2025-01-09 12:40:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:09,138 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-01-09 12:40:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-01-09 12:40:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:40:09,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:09,139 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:40:09,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -775828971, now seen corresponding path program 1 times [2025-01-09 12:40:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753817774] [2025-01-09 12:40:09,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:09,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:40:09,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:40:09,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:09,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:40:18,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:18,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753817774] [2025-01-09 12:40:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753817774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:40:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355585447] [2025-01-09 12:40:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:18,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:40:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:18,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:40:18,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:40:18,472 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:20,073 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2025-01-09 12:40:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:40:20,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:40:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:20,076 INFO L225 Difference]: With dead ends: 152 [2025-01-09 12:40:20,076 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 12:40:20,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:40:20,076 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 46 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:20,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 394 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:40:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 12:40:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2025-01-09 12:40:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 77 states have internal predecessors, (88), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:40:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-01-09 12:40:20,091 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 141 [2025-01-09 12:40:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:20,091 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-01-09 12:40:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-01-09 12:40:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:40:20,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:20,093 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:20,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:40:20,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1476893549, now seen corresponding path program 1 times [2025-01-09 12:40:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787792040] [2025-01-09 12:40:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:20,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:40:20,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:40:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:40:33,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:33,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787792040] [2025-01-09 12:40:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787792040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:40:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022441704] [2025-01-09 12:40:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:33,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:40:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:33,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:40:33,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:40:33,058 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:34,410 INFO L93 Difference]: Finished difference Result 170 states and 237 transitions. [2025-01-09 12:40:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:40:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:40:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:34,411 INFO L225 Difference]: With dead ends: 170 [2025-01-09 12:40:34,411 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 12:40:34,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:40:34,412 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 29 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:34,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 534 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:40:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 12:40:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 138. [2025-01-09 12:40:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.155844155844156) internal successors, (89), 78 states have internal predecessors, (89), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:40:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2025-01-09 12:40:34,422 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 141 [2025-01-09 12:40:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2025-01-09 12:40:34,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:40:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2025-01-09 12:40:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:40:34,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:34,424 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:40:34,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -117235879, now seen corresponding path program 1 times [2025-01-09 12:40:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591926640] [2025-01-09 12:40:34,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:34,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:40:34,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:40:34,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat