./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 87a957337dc32d96943bc73c6af7d43fd798bbd6e6b58f7ac997d11314c3b953 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:45:01,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:45:01,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:45:01,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:45:01,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:45:01,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:45:01,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:45:01,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:45:01,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:45:01,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:45:01,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:45:01,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:45:01,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:45:01,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:45:01,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:45:01,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:45:01,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:45:01,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:45:01,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:45:01,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:45:01,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:45:01,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:45:01,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:01,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:45:01,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:45:01,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:45:01,193 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/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 -> 87a957337dc32d96943bc73c6af7d43fd798bbd6e6b58f7ac997d11314c3b953 [2025-03-08 15:45:01,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:45:01,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:45:01,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:45:01,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:45:01,448 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:45:01,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i [2025-03-08 15:45:02,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5827c8973/5c7ce65f2d574f249bfc1bd8c67dba16/FLAG432f49137 [2025-03-08 15:45:02,914 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:45:02,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i [2025-03-08 15:45:02,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5827c8973/5c7ce65f2d574f249bfc1bd8c67dba16/FLAG432f49137 [2025-03-08 15:45:02,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5827c8973/5c7ce65f2d574f249bfc1bd8c67dba16 [2025-03-08 15:45:02,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:45:02,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:45:02,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:02,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:45:02,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:45:02,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:02" (1/1) ... [2025-03-08 15:45:02,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:02, skipping insertion in model container [2025-03-08 15:45:02,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:02" (1/1) ... [2025-03-08 15:45:02,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:45:03,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i[916,929] [2025-03-08 15:45:03,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:03,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:45:03,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i[916,929] [2025-03-08 15:45:03,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:03,370 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:45:03,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03 WrapperNode [2025-03-08 15:45:03,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:03,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:03,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:45:03,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:45:03,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,472 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 801 [2025-03-08 15:45:03,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:03,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:45:03,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:45:03,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:45:03,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,577 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-03-08 15:45:03,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:45:03,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:45:03,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:45:03,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:45:03,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (1/1) ... [2025-03-08 15:45:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:03,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:03,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:45:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:45:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:45:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:45:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:45:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:45:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:45:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:45:03,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:45:03,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:45:04,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc property_#t~bitwise58#1;havoc property_#t~bitwise59#1;havoc property_#t~bitwise60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1;havoc property_#t~bitwise75#1;havoc property_#t~short76#1; [2025-03-08 15:45:04,907 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-08 15:45:04,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:45:04,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:45:04,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:45:04,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:04 BoogieIcfgContainer [2025-03-08 15:45:04,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:45:04,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:45:04,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:45:04,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:45:04,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:45:02" (1/3) ... [2025-03-08 15:45:04,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c68254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:04, skipping insertion in model container [2025-03-08 15:45:04,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:03" (2/3) ... [2025-03-08 15:45:04,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c68254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:04, skipping insertion in model container [2025-03-08 15:45:04,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:04" (3/3) ... [2025-03-08 15:45:04,953 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-52.i [2025-03-08 15:45:04,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:45:04,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-52.i that has 2 procedures, 317 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:45:05,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:45:05,034 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;@2e82537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:45:05,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:45:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 248 states have (on average 1.5362903225806452) internal successors, (381), 249 states have internal predecessors, (381), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:45:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:45:05,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:05,061 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:05,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1482576970, now seen corresponding path program 1 times [2025-03-08 15:45:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656025562] [2025-03-08 15:45:05,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:05,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:05,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:05,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:45:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656025562] [2025-03-08 15:45:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656025562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502195572] [2025-03-08 15:45:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:05,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:05,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:05,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:45:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:06,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:45:06,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:45:06,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:45:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502195572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:06,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:45:06,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:45:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852400554] [2025-03-08 15:45:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:06,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:45:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:06,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:45:06,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:45:06,195 INFO L87 Difference]: Start difference. First operand has 317 states, 248 states have (on average 1.5362903225806452) internal successors, (381), 249 states have internal predecessors, (381), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:45:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:06,291 INFO L93 Difference]: Finished difference Result 628 states and 1087 transitions. [2025-03-08 15:45:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:45:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 483 [2025-03-08 15:45:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:06,302 INFO L225 Difference]: With dead ends: 628 [2025-03-08 15:45:06,302 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 15:45:06,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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-03-08 15:45:06,311 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:06,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 15:45:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-08 15:45:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.5284552845528456) internal successors, (376), 246 states have internal predecessors, (376), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:45:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 508 transitions. [2025-03-08 15:45:06,386 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 508 transitions. Word has length 483 [2025-03-08 15:45:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:06,388 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 508 transitions. [2025-03-08 15:45:06,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:45:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 508 transitions. [2025-03-08 15:45:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:45:06,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:06,398 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:06,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:45:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:45:06,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -366457576, now seen corresponding path program 1 times [2025-03-08 15:45:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895241925] [2025-03-08 15:45:06,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:06,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:06,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:06,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:06,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895241925] [2025-03-08 15:45:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895241925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970598690] [2025-03-08 15:45:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:07,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:07,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:07,077 INFO L87 Difference]: Start difference. First operand 314 states and 508 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:07,215 INFO L93 Difference]: Finished difference Result 829 states and 1345 transitions. [2025-03-08 15:45:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-03-08 15:45:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:07,222 INFO L225 Difference]: With dead ends: 829 [2025-03-08 15:45:07,223 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 15:45:07,224 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-03-08 15:45:07,225 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 327 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:07,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 941 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 15:45:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 515. [2025-03-08 15:45:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 441 states have (on average 1.5691609977324263) internal successors, (692), 442 states have internal predecessors, (692), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-08 15:45:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 834 transitions. [2025-03-08 15:45:07,272 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 834 transitions. Word has length 483 [2025-03-08 15:45:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 834 transitions. [2025-03-08 15:45:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 834 transitions. [2025-03-08 15:45:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:45:07,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:07,284 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:07,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:45:07,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:07,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1166993129, now seen corresponding path program 1 times [2025-03-08 15:45:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:07,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177232778] [2025-03-08 15:45:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:07,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:07,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:07,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:07,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:07,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177232778] [2025-03-08 15:45:07,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177232778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:07,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152663431] [2025-03-08 15:45:07,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:07,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:07,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:07,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:07,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:07,724 INFO L87 Difference]: Start difference. First operand 515 states and 834 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:07,871 INFO L93 Difference]: Finished difference Result 1539 states and 2496 transitions. [2025-03-08 15:45:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-03-08 15:45:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:07,884 INFO L225 Difference]: With dead ends: 1539 [2025-03-08 15:45:07,884 INFO L226 Difference]: Without dead ends: 1027 [2025-03-08 15:45:07,887 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-03-08 15:45:07,887 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 466 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:07,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1227 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-08 15:45:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1025. [2025-03-08 15:45:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 878 states have (on average 1.5671981776765376) internal successors, (1376), 880 states have internal predecessors, (1376), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-08 15:45:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1660 transitions. [2025-03-08 15:45:07,980 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1660 transitions. Word has length 483 [2025-03-08 15:45:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:07,983 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1660 transitions. [2025-03-08 15:45:07,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1660 transitions. [2025-03-08 15:45:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:45:07,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:07,994 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:07,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:45:07,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1155677002, now seen corresponding path program 1 times [2025-03-08 15:45:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752782602] [2025-03-08 15:45:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:08,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:08,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:08,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752782602] [2025-03-08 15:45:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752782602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705145430] [2025-03-08 15:45:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:08,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:08,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:08,369 INFO L87 Difference]: Start difference. First operand 1025 states and 1660 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:08,523 INFO L93 Difference]: Finished difference Result 3051 states and 4942 transitions. [2025-03-08 15:45:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:08,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-03-08 15:45:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:08,533 INFO L225 Difference]: With dead ends: 3051 [2025-03-08 15:45:08,533 INFO L226 Difference]: Without dead ends: 2029 [2025-03-08 15:45:08,535 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-03-08 15:45:08,536 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 443 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:08,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1003 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-03-08 15:45:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2027. [2025-03-08 15:45:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1734 states have (on average 1.552479815455594) internal successors, (2692), 1738 states have internal predecessors, (2692), 284 states have call successors, (284), 8 states have call predecessors, (284), 8 states have return successors, (284), 280 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-08 15:45:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 3260 transitions. [2025-03-08 15:45:08,655 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 3260 transitions. Word has length 483 [2025-03-08 15:45:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 3260 transitions. [2025-03-08 15:45:08,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 3260 transitions. [2025-03-08 15:45:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:45:08,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:08,668 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:08,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:45:08,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:08,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 459677461, now seen corresponding path program 1 times [2025-03-08 15:45:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189987174] [2025-03-08 15:45:08,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:08,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:45:08,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:45:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189987174] [2025-03-08 15:45:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189987174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:09,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:09,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573126561] [2025-03-08 15:45:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:09,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:09,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:09,207 INFO L87 Difference]: Start difference. First operand 2027 states and 3260 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:09,314 INFO L93 Difference]: Finished difference Result 4059 states and 6533 transitions. [2025-03-08 15:45:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-03-08 15:45:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:09,324 INFO L225 Difference]: With dead ends: 4059 [2025-03-08 15:45:09,324 INFO L226 Difference]: Without dead ends: 2035 [2025-03-08 15:45:09,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:09,328 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:09,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2025-03-08 15:45:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035. [2025-03-08 15:45:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1742 states have (on average 1.5499425947187142) internal successors, (2700), 1746 states have internal predecessors, (2700), 284 states have call successors, (284), 8 states have call predecessors, (284), 8 states have return successors, (284), 280 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-08 15:45:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3268 transitions. [2025-03-08 15:45:09,476 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3268 transitions. Word has length 483 [2025-03-08 15:45:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:09,477 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 3268 transitions. [2025-03-08 15:45:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3268 transitions. [2025-03-08 15:45:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:45:09,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:09,490 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:09,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:45:09,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:09,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 754771794, now seen corresponding path program 1 times [2025-03-08 15:45:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555808643] [2025-03-08 15:45:09,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:09,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:45:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:45:09,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555808643] [2025-03-08 15:45:10,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555808643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:10,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:10,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:10,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032052990] [2025-03-08 15:45:10,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:10,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:10,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:10,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:10,606 INFO L87 Difference]: Start difference. First operand 2035 states and 3268 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:10,853 INFO L93 Difference]: Finished difference Result 4083 states and 6545 transitions. [2025-03-08 15:45:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 484 [2025-03-08 15:45:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:10,864 INFO L225 Difference]: With dead ends: 4083 [2025-03-08 15:45:10,865 INFO L226 Difference]: Without dead ends: 2051 [2025-03-08 15:45:10,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:10,870 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 311 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:10,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1037 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-08 15:45:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2025-03-08 15:45:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1754 states have (on average 1.541619156214367) internal successors, (2704), 1758 states have internal predecessors, (2704), 284 states have call successors, (284), 12 states have call predecessors, (284), 12 states have return successors, (284), 280 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-08 15:45:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 3272 transitions. [2025-03-08 15:45:10,946 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 3272 transitions. Word has length 484 [2025-03-08 15:45:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:10,947 INFO L471 AbstractCegarLoop]: Abstraction has 2051 states and 3272 transitions. [2025-03-08 15:45:10,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 3272 transitions. [2025-03-08 15:45:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 15:45:10,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:10,955 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:10,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:45:10,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1168505849, now seen corresponding path program 1 times [2025-03-08 15:45:10,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691620214] [2025-03-08 15:45:10,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:11,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 15:45:11,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 15:45:11,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:11,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691620214] [2025-03-08 15:45:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691620214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:12,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:45:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502884056] [2025-03-08 15:45:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:45:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:12,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:45:12,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:12,078 INFO L87 Difference]: Start difference. First operand 2051 states and 3272 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:12,671 INFO L93 Difference]: Finished difference Result 6529 states and 10393 transitions. [2025-03-08 15:45:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-03-08 15:45:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:12,690 INFO L225 Difference]: With dead ends: 6529 [2025-03-08 15:45:12,690 INFO L226 Difference]: Without dead ends: 4481 [2025-03-08 15:45:12,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:12,695 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 766 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:12,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1854 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2025-03-08 15:45:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4355. [2025-03-08 15:45:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4355 states, 3832 states have (on average 1.5495824634655533) internal successors, (5938), 3846 states have internal predecessors, (5938), 494 states have call successors, (494), 28 states have call predecessors, (494), 28 states have return successors, (494), 480 states have call predecessors, (494), 494 states have call successors, (494) [2025-03-08 15:45:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 6926 transitions. [2025-03-08 15:45:12,877 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 6926 transitions. Word has length 485 [2025-03-08 15:45:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:12,878 INFO L471 AbstractCegarLoop]: Abstraction has 4355 states and 6926 transitions. [2025-03-08 15:45:12,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 6926 transitions. [2025-03-08 15:45:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 15:45:12,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:12,886 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:12,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:45:12,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2049908038, now seen corresponding path program 1 times [2025-03-08 15:45:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668898772] [2025-03-08 15:45:12,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 15:45:12,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 15:45:12,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:12,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668898772] [2025-03-08 15:45:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668898772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356161269] [2025-03-08 15:45:13,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:13,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:13,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:13,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:13,091 INFO L87 Difference]: Start difference. First operand 4355 states and 6926 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:13,274 INFO L93 Difference]: Finished difference Result 8727 states and 13864 transitions. [2025-03-08 15:45:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-03-08 15:45:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:13,296 INFO L225 Difference]: With dead ends: 8727 [2025-03-08 15:45:13,297 INFO L226 Difference]: Without dead ends: 4375 [2025-03-08 15:45:13,335 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-03-08 15:45:13,337 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 429 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:13,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1262 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2025-03-08 15:45:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 2529. [2025-03-08 15:45:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2198 states have (on average 1.535031847133758) internal successors, (3374), 2204 states have internal predecessors, (3374), 310 states have call successors, (310), 20 states have call predecessors, (310), 20 states have return successors, (310), 304 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-08 15:45:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 3994 transitions. [2025-03-08 15:45:13,459 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 3994 transitions. Word has length 485 [2025-03-08 15:45:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:13,461 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 3994 transitions. [2025-03-08 15:45:13,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3994 transitions. [2025-03-08 15:45:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 15:45:13,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:13,466 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:45:13,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1046323993, now seen corresponding path program 1 times [2025-03-08 15:45:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862790417] [2025-03-08 15:45:13,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 15:45:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 15:45:13,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862790417] [2025-03-08 15:45:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862790417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:14,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:14,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821694122] [2025-03-08 15:45:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:14,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:14,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:14,301 INFO L87 Difference]: Start difference. First operand 2529 states and 3994 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:14,948 INFO L93 Difference]: Finished difference Result 11273 states and 17858 transitions. [2025-03-08 15:45:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-03-08 15:45:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:15,001 INFO L225 Difference]: With dead ends: 11273 [2025-03-08 15:45:15,002 INFO L226 Difference]: Without dead ends: 8747 [2025-03-08 15:45:15,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:15,011 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 1357 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:15,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 2836 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8747 states. [2025-03-08 15:45:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8747 to 5173. [2025-03-08 15:45:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 4512 states have (on average 1.5283687943262412) internal successors, (6896), 4524 states have internal predecessors, (6896), 620 states have call successors, (620), 40 states have call predecessors, (620), 40 states have return successors, (620), 608 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-08 15:45:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 8136 transitions. [2025-03-08 15:45:15,307 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 8136 transitions. Word has length 485 [2025-03-08 15:45:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:15,308 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 8136 transitions. [2025-03-08 15:45:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 8136 transitions. [2025-03-08 15:45:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 15:45:15,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:15,317 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:45:15,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash -149533285, now seen corresponding path program 1 times [2025-03-08 15:45:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858017443] [2025-03-08 15:45:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:15,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 15:45:15,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 15:45:15,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:15,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858017443] [2025-03-08 15:45:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858017443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449290927] [2025-03-08 15:45:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:16,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:16,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:16,531 INFO L87 Difference]: Start difference. First operand 5173 states and 8136 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:17,739 INFO L93 Difference]: Finished difference Result 21294 states and 34124 transitions. [2025-03-08 15:45:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:45:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-03-08 15:45:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:17,787 INFO L225 Difference]: With dead ends: 21294 [2025-03-08 15:45:17,787 INFO L226 Difference]: Without dead ends: 16124 [2025-03-08 15:45:17,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:45:17,805 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 2239 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2239 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:17,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2239 Valid, 3648 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:45:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2025-03-08 15:45:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 7008. [2025-03-08 15:45:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7008 states, 6277 states have (on average 1.5618926238649036) internal successors, (9804), 6289 states have internal predecessors, (9804), 686 states have call successors, (686), 44 states have call predecessors, (686), 44 states have return successors, (686), 674 states have call predecessors, (686), 686 states have call successors, (686) [2025-03-08 15:45:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7008 states to 7008 states and 11176 transitions. [2025-03-08 15:45:18,143 INFO L78 Accepts]: Start accepts. Automaton has 7008 states and 11176 transitions. Word has length 485 [2025-03-08 15:45:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:18,144 INFO L471 AbstractCegarLoop]: Abstraction has 7008 states and 11176 transitions. [2025-03-08 15:45:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7008 states and 11176 transitions. [2025-03-08 15:45:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 15:45:18,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:18,152 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:45:18,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:18,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 619636730, now seen corresponding path program 1 times [2025-03-08 15:45:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858343270] [2025-03-08 15:45:18,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:18,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 15:45:18,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 15:45:18,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:18,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:18,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:18,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858343270] [2025-03-08 15:45:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858343270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:18,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:18,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895284293] [2025-03-08 15:45:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:18,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:18,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:18,902 INFO L87 Difference]: Start difference. First operand 7008 states and 11176 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:19,542 INFO L93 Difference]: Finished difference Result 17213 states and 27364 transitions. [2025-03-08 15:45:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-03-08 15:45:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:19,577 INFO L225 Difference]: With dead ends: 17213 [2025-03-08 15:45:19,578 INFO L226 Difference]: Without dead ends: 11351 [2025-03-08 15:45:19,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:19,595 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 1527 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:19,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 2717 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11351 states. [2025-03-08 15:45:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11351 to 7505. [2025-03-08 15:45:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7505 states, 6774 states have (on average 1.55565397106584) internal successors, (10538), 6786 states have internal predecessors, (10538), 686 states have call successors, (686), 44 states have call predecessors, (686), 44 states have return successors, (686), 674 states have call predecessors, (686), 686 states have call successors, (686) [2025-03-08 15:45:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7505 states to 7505 states and 11910 transitions. [2025-03-08 15:45:19,945 INFO L78 Accepts]: Start accepts. Automaton has 7505 states and 11910 transitions. Word has length 485 [2025-03-08 15:45:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:19,946 INFO L471 AbstractCegarLoop]: Abstraction has 7505 states and 11910 transitions. [2025-03-08 15:45:19,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7505 states and 11910 transitions. [2025-03-08 15:45:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 15:45:19,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:19,956 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:45:19,957 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1368204158, now seen corresponding path program 1 times [2025-03-08 15:45:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565312766] [2025-03-08 15:45:19,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:19,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:45:20,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:45:20,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:20,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565312766] [2025-03-08 15:45:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565312766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517768150] [2025-03-08 15:45:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:21,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:21,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:21,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:21,215 INFO L87 Difference]: Start difference. First operand 7505 states and 11910 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:22,618 INFO L93 Difference]: Finished difference Result 33191 states and 52980 transitions. [2025-03-08 15:45:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:45:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-03-08 15:45:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:22,679 INFO L225 Difference]: With dead ends: 33191 [2025-03-08 15:45:22,679 INFO L226 Difference]: Without dead ends: 26861 [2025-03-08 15:45:22,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:45:22,698 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1646 mSDsluCounter, 3347 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:22,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 3934 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:45:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26861 states. [2025-03-08 15:45:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26861 to 25857. [2025-03-08 15:45:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25857 states, 24549 states have (on average 1.5905739541325512) internal successors, (39047), 24621 states have internal predecessors, (39047), 1170 states have call successors, (1170), 137 states have call predecessors, (1170), 137 states have return successors, (1170), 1098 states have call predecessors, (1170), 1170 states have call successors, (1170) [2025-03-08 15:45:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25857 states to 25857 states and 41387 transitions. [2025-03-08 15:45:23,461 INFO L78 Accepts]: Start accepts. Automaton has 25857 states and 41387 transitions. Word has length 486 [2025-03-08 15:45:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:23,462 INFO L471 AbstractCegarLoop]: Abstraction has 25857 states and 41387 transitions. [2025-03-08 15:45:23,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25857 states and 41387 transitions. [2025-03-08 15:45:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 15:45:23,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:23,503 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:23,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:45:23,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:23,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1256249569, now seen corresponding path program 1 times [2025-03-08 15:45:23,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:23,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076558785] [2025-03-08 15:45:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:23,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:45:23,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:45:23,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:23,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076558785] [2025-03-08 15:45:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076558785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:24,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:24,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:45:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228193937] [2025-03-08 15:45:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:24,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:45:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:24,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:45:24,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:24,867 INFO L87 Difference]: Start difference. First operand 25857 states and 41387 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:27,764 INFO L93 Difference]: Finished difference Result 102861 states and 165252 transitions. [2025-03-08 15:45:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:45:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-03-08 15:45:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:27,969 INFO L225 Difference]: With dead ends: 102861 [2025-03-08 15:45:27,970 INFO L226 Difference]: Without dead ends: 78439 [2025-03-08 15:45:28,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:45:28,010 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1439 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:28,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3245 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:45:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78439 states. [2025-03-08 15:45:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78439 to 69829. [2025-03-08 15:45:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69829 states, 67959 states have (on average 1.6168572227372386) internal successors, (109880), 68071 states have internal predecessors, (109880), 1662 states have call successors, (1662), 207 states have call predecessors, (1662), 207 states have return successors, (1662), 1550 states have call predecessors, (1662), 1662 states have call successors, (1662) [2025-03-08 15:45:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69829 states to 69829 states and 113204 transitions. [2025-03-08 15:45:29,768 INFO L78 Accepts]: Start accepts. Automaton has 69829 states and 113204 transitions. Word has length 486 [2025-03-08 15:45:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:29,769 INFO L471 AbstractCegarLoop]: Abstraction has 69829 states and 113204 transitions. [2025-03-08 15:45:29,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 69829 states and 113204 transitions. [2025-03-08 15:45:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 15:45:29,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:29,860 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:29,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:45:29,860 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:29,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash 72902272, now seen corresponding path program 1 times [2025-03-08 15:45:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:29,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053479639] [2025-03-08 15:45:29,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:45:30,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:45:30,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053479639] [2025-03-08 15:45:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053479639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:32,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:32,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016527816] [2025-03-08 15:45:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:32,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:32,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:32,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:32,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:32,464 INFO L87 Difference]: Start difference. First operand 69829 states and 113204 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:36,236 INFO L93 Difference]: Finished difference Result 297657 states and 486681 transitions. [2025-03-08 15:45:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:45:36,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-03-08 15:45:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:36,701 INFO L225 Difference]: With dead ends: 297657 [2025-03-08 15:45:36,701 INFO L226 Difference]: Without dead ends: 251345 [2025-03-08 15:45:36,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:45:36,756 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1735 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 3460 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:36,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 3460 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:45:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251345 states. [2025-03-08 15:45:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251345 to 94919. [2025-03-08 15:45:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94919 states, 93049 states have (on average 1.614214016270997) internal successors, (150201), 93161 states have internal predecessors, (150201), 1662 states have call successors, (1662), 207 states have call predecessors, (1662), 207 states have return successors, (1662), 1550 states have call predecessors, (1662), 1662 states have call successors, (1662) [2025-03-08 15:45:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94919 states to 94919 states and 153525 transitions. [2025-03-08 15:45:39,626 INFO L78 Accepts]: Start accepts. Automaton has 94919 states and 153525 transitions. Word has length 486 [2025-03-08 15:45:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:39,627 INFO L471 AbstractCegarLoop]: Abstraction has 94919 states and 153525 transitions. [2025-03-08 15:45:39,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 94919 states and 153525 transitions. [2025-03-08 15:45:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 15:45:39,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:39,752 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:45:39,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1852631039, now seen corresponding path program 1 times [2025-03-08 15:45:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423165806] [2025-03-08 15:45:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:45:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:45:41,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:41,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 90 proven. 105 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 15:45:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423165806] [2025-03-08 15:45:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423165806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776545602] [2025-03-08 15:45:42,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:42,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:42,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:42,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:45:42,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:45:42,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:45:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:42,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:45:42,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 2099 proven. 168 refuted. 0 times theorem prover too weak. 6313 trivial. 0 not checked. [2025-03-08 15:45:43,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 27 proven. 168 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 15:45:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776545602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:43,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-08 15:45:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521991553] [2025-03-08 15:45:43,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:43,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:45:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:43,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:45:43,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:45:43,549 INFO L87 Difference]: Start difference. First operand 94919 states and 153525 transitions. Second operand has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 13 states have internal predecessors, (328), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) [2025-03-08 15:45:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:46,024 INFO L93 Difference]: Finished difference Result 186294 states and 302609 transitions. [2025-03-08 15:45:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:45:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 13 states have internal predecessors, (328), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) Word has length 486 [2025-03-08 15:45:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:46,161 INFO L225 Difference]: With dead ends: 186294 [2025-03-08 15:45:46,161 INFO L226 Difference]: Without dead ends: 91680 [2025-03-08 15:45:46,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 972 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:45:46,213 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 1808 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:46,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 3000 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:45:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91680 states. [2025-03-08 15:45:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91680 to 42609. [2025-03-08 15:45:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42609 states, 41187 states have (on average 1.5927355719037561) internal successors, (65600), 41239 states have internal predecessors, (65600), 1254 states have call successors, (1254), 167 states have call predecessors, (1254), 167 states have return successors, (1254), 1202 states have call predecessors, (1254), 1254 states have call successors, (1254) [2025-03-08 15:45:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42609 states to 42609 states and 68108 transitions. [2025-03-08 15:45:47,510 INFO L78 Accepts]: Start accepts. Automaton has 42609 states and 68108 transitions. Word has length 486 [2025-03-08 15:45:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:47,511 INFO L471 AbstractCegarLoop]: Abstraction has 42609 states and 68108 transitions. [2025-03-08 15:45:47,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 13 states have internal predecessors, (328), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) [2025-03-08 15:45:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42609 states and 68108 transitions. [2025-03-08 15:45:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:45:47,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:47,560 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:47,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:45:47,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 15:45:47,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:47,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 285813600, now seen corresponding path program 1 times [2025-03-08 15:45:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952603528] [2025-03-08 15:45:47,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:45:48,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:45:48,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:49,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952603528] [2025-03-08 15:45:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952603528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:45:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702537284] [2025-03-08 15:45:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:49,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:45:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:49,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:45:49,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:49,407 INFO L87 Difference]: Start difference. First operand 42609 states and 68108 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:51,163 INFO L93 Difference]: Finished difference Result 130560 states and 211222 transitions. [2025-03-08 15:45:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:45:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 488 [2025-03-08 15:45:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:51,296 INFO L225 Difference]: With dead ends: 130560 [2025-03-08 15:45:51,296 INFO L226 Difference]: Without dead ends: 90180 [2025-03-08 15:45:51,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:51,336 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1632 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:51,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 1712 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:45:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90180 states. [2025-03-08 15:45:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90180 to 72575. [2025-03-08 15:45:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72575 states, 70681 states have (on average 1.6009252840225803) internal successors, (113155), 70753 states have internal predecessors, (113155), 1670 states have call successors, (1670), 223 states have call predecessors, (1670), 223 states have return successors, (1670), 1598 states have call predecessors, (1670), 1670 states have call successors, (1670) [2025-03-08 15:45:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72575 states to 72575 states and 116495 transitions. [2025-03-08 15:45:52,931 INFO L78 Accepts]: Start accepts. Automaton has 72575 states and 116495 transitions. Word has length 488 [2025-03-08 15:45:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 72575 states and 116495 transitions. [2025-03-08 15:45:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 72575 states and 116495 transitions. [2025-03-08 15:45:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:45:52,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:52,996 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:52,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:45:52,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:52,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1611624451, now seen corresponding path program 1 times [2025-03-08 15:45:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207622784] [2025-03-08 15:45:52,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:45:53,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:45:53,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:45:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207622784] [2025-03-08 15:45:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207622784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:53,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:53,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553334422] [2025-03-08 15:45:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:53,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:53,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:53,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:53,266 INFO L87 Difference]: Start difference. First operand 72575 states and 116495 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:54,714 INFO L93 Difference]: Finished difference Result 136940 states and 219990 transitions. [2025-03-08 15:45:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 488 [2025-03-08 15:45:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:54,823 INFO L225 Difference]: With dead ends: 136940 [2025-03-08 15:45:54,824 INFO L226 Difference]: Without dead ends: 66268 [2025-03-08 15:45:54,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-08 15:45:54,868 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 441 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:54,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 855 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66268 states. [2025-03-08 15:45:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66268 to 63633. [2025-03-08 15:45:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63633 states, 61739 states have (on average 1.5848329257033642) internal successors, (97846), 61811 states have internal predecessors, (97846), 1670 states have call successors, (1670), 223 states have call predecessors, (1670), 223 states have return successors, (1670), 1598 states have call predecessors, (1670), 1670 states have call successors, (1670) [2025-03-08 15:45:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63633 states to 63633 states and 101186 transitions. [2025-03-08 15:45:56,581 INFO L78 Accepts]: Start accepts. Automaton has 63633 states and 101186 transitions. Word has length 488 [2025-03-08 15:45:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:56,581 INFO L471 AbstractCegarLoop]: Abstraction has 63633 states and 101186 transitions. [2025-03-08 15:45:56,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:45:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 63633 states and 101186 transitions. [2025-03-08 15:45:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:45:56,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:56,643 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:45:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:45:56,643 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1199241951, now seen corresponding path program 1 times [2025-03-08 15:45:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159736544] [2025-03-08 15:45:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:56,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:45:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:45:56,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat