./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:27:31,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:27:31,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:27:31,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:27:31,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:27:31,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:27:31,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:27:31,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:27:31,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:27:31,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:27:31,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:27:31,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:27:31,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:27:31,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:27:31,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:27:31,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:27:31,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:27:31,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:27:31,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:27:31,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:27:31,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:27:31,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:27:31,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:31,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:27:31,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2025-02-06 02:27:31,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:27:31,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:27:31,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:27:31,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:27:31,823 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:27:31,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:33,020 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30597f9bd/685ed7b882814a7ba989482734b80844/FLAG93e9fd279 [2025-02-06 02:27:33,313 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:27:33,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:33,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30597f9bd/685ed7b882814a7ba989482734b80844/FLAG93e9fd279 [2025-02-06 02:27:33,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30597f9bd/685ed7b882814a7ba989482734b80844 [2025-02-06 02:27:33,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:27:33,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:27:33,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:33,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:27:33,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:27:33,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcac649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33, skipping insertion in model container [2025-02-06 02:27:33,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:27:33,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-02-06 02:27:33,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:33,750 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:27:33,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-02-06 02:27:33,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:33,783 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:27:33,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33 WrapperNode [2025-02-06 02:27:33,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:33,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:33,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:27:33,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:27:33,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,818 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-02-06 02:27:33,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:33,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:27:33,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:27:33,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:27:33,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,845 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-02-06 02:27:33,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:27:33,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:27:33,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:27:33,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:27:33,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (1/1) ... [2025-02-06 02:27:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:33,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:27:33,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:27:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:27:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:27:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:27:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:27:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:27:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:27:33,956 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:27:33,958 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:27:34,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~bitwise16#1;havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-02-06 02:27:34,306 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-06 02:27:34,306 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:27:34,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:27:34,321 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:27:34,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:34 BoogieIcfgContainer [2025-02-06 02:27:34,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:27:34,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:27:34,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:27:34,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:27:34,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:27:33" (1/3) ... [2025-02-06 02:27:34,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ff1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:34, skipping insertion in model container [2025-02-06 02:27:34,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:33" (2/3) ... [2025-02-06 02:27:34,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ff1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:34, skipping insertion in model container [2025-02-06 02:27:34,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:34" (3/3) ... [2025-02-06 02:27:34,329 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:34,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:27:34,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-32.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:27:34,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:27:34,404 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;@70f485f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:27:34,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:27:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:27:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:27:34,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:34,419 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:34,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -886028478, now seen corresponding path program 1 times [2025-02-06 02:27:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-06 02:27:34,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:34,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:27:34,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:27:34,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:34,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:27:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-06 02:27:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964228395] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:27:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931755977] [2025-02-06 02:27:34,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:34,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:34,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:34,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:27:34,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:27:34,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:27:34,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:34,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:27:34,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:27:34,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:27:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931755977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:34,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:27:34,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:27:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121802220] [2025-02-06 02:27:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:34,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:27:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:34,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:27:34,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:27:34,847 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:27:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:34,880 INFO L93 Difference]: Finished difference Result 150 states and 245 transitions. [2025-02-06 02:27:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:27:34,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2025-02-06 02:27:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:34,887 INFO L225 Difference]: With dead ends: 150 [2025-02-06 02:27:34,887 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 02:27:34,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-02-06 02:27:34,894 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 02:27:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 02:27:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:27:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2025-02-06 02:27:34,935 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2025-02-06 02:27:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2025-02-06 02:27:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:27:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2025-02-06 02:27:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:27:34,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:34,939 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:34,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:27:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:27:35,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:35,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -523520190, now seen corresponding path program 1 times [2025-02-06 02:27:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006796182] [2025-02-06 02:27:35,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:35,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:27:35,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:27:35,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:35,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006796182] [2025-02-06 02:27:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006796182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:27:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431021177] [2025-02-06 02:27:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:27:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:35,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:27:35,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:27:35,509 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:35,695 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2025-02-06 02:27:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:27:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 02:27:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:35,697 INFO L225 Difference]: With dead ends: 255 [2025-02-06 02:27:35,699 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 02:27:35,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:35,700 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 142 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:35,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 335 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 02:27:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2025-02-06 02:27:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 02:27:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2025-02-06 02:27:35,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2025-02-06 02:27:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:35,731 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2025-02-06 02:27:35,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2025-02-06 02:27:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:27:35,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:35,733 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:27:35,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 829789507, now seen corresponding path program 1 times [2025-02-06 02:27:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074416182] [2025-02-06 02:27:35,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:35,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:27:35,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:27:35,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:35,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074416182] [2025-02-06 02:27:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074416182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:27:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415493790] [2025-02-06 02:27:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:27:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:35,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:27:35,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:35,933 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:36,197 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2025-02-06 02:27:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:27:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 02:27:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:36,201 INFO L225 Difference]: With dead ends: 406 [2025-02-06 02:27:36,201 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 02:27:36,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:36,206 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:36,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 376 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 02:27:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2025-02-06 02:27:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2025-02-06 02:27:36,257 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2025-02-06 02:27:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:36,260 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2025-02-06 02:27:36,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2025-02-06 02:27:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 02:27:36,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:36,261 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:36,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:27:36,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:36,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:36,262 INFO L85 PathProgramCache]: Analyzing trace with hash -671767837, now seen corresponding path program 1 times [2025-02-06 02:27:36,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:36,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641056074] [2025-02-06 02:27:36,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:36,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 02:27:36,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 02:27:36,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:36,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641056074] [2025-02-06 02:27:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641056074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:27:36,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490197628] [2025-02-06 02:27:36,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:27:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:36,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:27:36,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:27:36,817 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:37,050 INFO L93 Difference]: Finished difference Result 422 states and 633 transitions. [2025-02-06 02:27:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:27:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-02-06 02:27:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:37,055 INFO L225 Difference]: With dead ends: 422 [2025-02-06 02:27:37,055 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 02:27:37,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:37,056 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 163 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:37,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 276 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 02:27:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 248. [2025-02-06 02:27:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2025-02-06 02:27:37,087 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 111 [2025-02-06 02:27:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:37,088 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2025-02-06 02:27:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2025-02-06 02:27:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 02:27:37,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:37,090 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:37,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:27:37,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:37,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1240276576, now seen corresponding path program 1 times [2025-02-06 02:27:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010659481] [2025-02-06 02:27:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:37,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 02:27:37,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 02:27:37,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:37,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010659481] [2025-02-06 02:27:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010659481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:27:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251871929] [2025-02-06 02:27:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:27:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:37,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:27:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:37,621 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:37,866 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2025-02-06 02:27:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:27:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2025-02-06 02:27:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:37,870 INFO L225 Difference]: With dead ends: 472 [2025-02-06 02:27:37,871 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 02:27:37,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:27:37,873 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 97 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:37,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 287 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 02:27:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 248. [2025-02-06 02:27:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 196 states have (on average 1.413265306122449) internal successors, (277), 196 states have internal predecessors, (277), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2025-02-06 02:27:37,897 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 112 [2025-02-06 02:27:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2025-02-06 02:27:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2025-02-06 02:27:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 02:27:37,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:37,901 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:37,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:27:37,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:37,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1407597283, now seen corresponding path program 1 times [2025-02-06 02:27:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:37,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679700266] [2025-02-06 02:27:37,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:37,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 02:27:37,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 02:27:37,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:37,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679700266] [2025-02-06 02:27:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679700266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:27:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406211370] [2025-02-06 02:27:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:27:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:38,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:27:38,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:38,023 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:38,158 INFO L93 Difference]: Finished difference Result 571 states and 859 transitions. [2025-02-06 02:27:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:27:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-02-06 02:27:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:38,162 INFO L225 Difference]: With dead ends: 571 [2025-02-06 02:27:38,162 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 02:27:38,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:38,163 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:38,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 369 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 02:27:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 304. [2025-02-06 02:27:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 252 states have (on average 1.4325396825396826) internal successors, (361), 252 states have internal predecessors, (361), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 457 transitions. [2025-02-06 02:27:38,208 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 457 transitions. Word has length 115 [2025-02-06 02:27:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:38,208 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 457 transitions. [2025-02-06 02:27:38,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 457 transitions. [2025-02-06 02:27:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 02:27:38,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:38,210 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:38,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:27:38,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash -335162376, now seen corresponding path program 1 times [2025-02-06 02:27:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590559170] [2025-02-06 02:27:38,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:38,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 02:27:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 02:27:38,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590559170] [2025-02-06 02:27:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590559170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:39,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:27:39,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175116190] [2025-02-06 02:27:39,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:39,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:39,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:39,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:39,544 INFO L87 Difference]: Start difference. First operand 304 states and 457 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:41,179 INFO L93 Difference]: Finished difference Result 675 states and 1015 transitions. [2025-02-06 02:27:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:27:41,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 02:27:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:41,182 INFO L225 Difference]: With dead ends: 675 [2025-02-06 02:27:41,182 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 02:27:41,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:27:41,184 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 576 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:27:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 02:27:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 396. [2025-02-06 02:27:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 344 states have (on average 1.4563953488372092) internal successors, (501), 344 states have internal predecessors, (501), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2025-02-06 02:27:41,208 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 116 [2025-02-06 02:27:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:41,209 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2025-02-06 02:27:41,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2025-02-06 02:27:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 02:27:41,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:41,211 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:41,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:27:41,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:41,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2007076759, now seen corresponding path program 1 times [2025-02-06 02:27:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456727479] [2025-02-06 02:27:41,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:41,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 02:27:41,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 02:27:41,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:41,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456727479] [2025-02-06 02:27:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456727479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091863269] [2025-02-06 02:27:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:41,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:27:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:41,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:27:41,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:27:41,279 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:41,324 INFO L93 Difference]: Finished difference Result 755 states and 1135 transitions. [2025-02-06 02:27:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:27:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 02:27:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:41,328 INFO L225 Difference]: With dead ends: 755 [2025-02-06 02:27:41,328 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 02:27:41,329 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-02-06 02:27:41,329 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:41,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 02:27:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 444. [2025-02-06 02:27:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 392 states have (on average 1.4209183673469388) internal successors, (557), 392 states have internal predecessors, (557), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 653 transitions. [2025-02-06 02:27:41,351 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 653 transitions. Word has length 116 [2025-02-06 02:27:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:41,351 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 653 transitions. [2025-02-06 02:27:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 653 transitions. [2025-02-06 02:27:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 02:27:41,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:41,352 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:27:41,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -840721001, now seen corresponding path program 1 times [2025-02-06 02:27:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496489132] [2025-02-06 02:27:41,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 02:27:41,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 02:27:41,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:41,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496489132] [2025-02-06 02:27:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496489132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:42,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:27:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879483921] [2025-02-06 02:27:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:42,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:42,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:42,278 INFO L87 Difference]: Start difference. First operand 444 states and 653 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:43,035 INFO L93 Difference]: Finished difference Result 827 states and 1203 transitions. [2025-02-06 02:27:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:27:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 02:27:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:43,039 INFO L225 Difference]: With dead ends: 827 [2025-02-06 02:27:43,039 INFO L226 Difference]: Without dead ends: 554 [2025-02-06 02:27:43,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:27:43,042 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:43,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 736 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:27:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-06 02:27:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 444. [2025-02-06 02:27:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 392 states have (on average 1.4209183673469388) internal successors, (557), 392 states have internal predecessors, (557), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 653 transitions. [2025-02-06 02:27:43,066 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 653 transitions. Word has length 116 [2025-02-06 02:27:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:43,067 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 653 transitions. [2025-02-06 02:27:43,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 653 transitions. [2025-02-06 02:27:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 02:27:43,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:43,068 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:43,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:27:43,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:43,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 254252112, now seen corresponding path program 1 times [2025-02-06 02:27:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8519287] [2025-02-06 02:27:43,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 02:27:43,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 02:27:43,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:43,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8519287] [2025-02-06 02:27:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8519287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575937163] [2025-02-06 02:27:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:43,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:27:43,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:43,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:27:43,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:27:43,142 INFO L87 Difference]: Start difference. First operand 444 states and 653 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:43,191 INFO L93 Difference]: Finished difference Result 791 states and 1163 transitions. [2025-02-06 02:27:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:27:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 02:27:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:43,194 INFO L225 Difference]: With dead ends: 791 [2025-02-06 02:27:43,194 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 02:27:43,195 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-02-06 02:27:43,195 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 40 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:43,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 219 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 02:27:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 400. [2025-02-06 02:27:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 348 states have (on average 1.3936781609195403) internal successors, (485), 348 states have internal predecessors, (485), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:27:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 581 transitions. [2025-02-06 02:27:43,214 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 581 transitions. Word has length 116 [2025-02-06 02:27:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:43,214 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 581 transitions. [2025-02-06 02:27:43,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 581 transitions. [2025-02-06 02:27:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 02:27:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:43,217 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:27:43,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1417662271, now seen corresponding path program 1 times [2025-02-06 02:27:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320246080] [2025-02-06 02:27:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 02:27:43,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 02:27:43,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320246080] [2025-02-06 02:27:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320246080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928664074] [2025-02-06 02:27:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:43,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:27:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:43,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:27:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:27:43,292 INFO L87 Difference]: Start difference. First operand 400 states and 581 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:43,340 INFO L93 Difference]: Finished difference Result 763 states and 1116 transitions. [2025-02-06 02:27:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:27:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 02:27:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:43,344 INFO L225 Difference]: With dead ends: 763 [2025-02-06 02:27:43,344 INFO L226 Difference]: Without dead ends: 490 [2025-02-06 02:27:43,345 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-02-06 02:27:43,345 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:43,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 186 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-06 02:27:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2025-02-06 02:27:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 419 states have (on average 1.3794749403341289) internal successors, (578), 419 states have internal predecessors, (578), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 02:27:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 706 transitions. [2025-02-06 02:27:43,363 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 706 transitions. Word has length 116 [2025-02-06 02:27:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 706 transitions. [2025-02-06 02:27:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 706 transitions. [2025-02-06 02:27:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 02:27:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:43,365 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:43,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:27:43,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:43,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -386666662, now seen corresponding path program 1 times [2025-02-06 02:27:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:43,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26807020] [2025-02-06 02:27:43,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 02:27:43,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 02:27:43,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26807020] [2025-02-06 02:27:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26807020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:43,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:27:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029820809] [2025-02-06 02:27:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:27:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:43,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:27:43,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:27:43,499 INFO L87 Difference]: Start difference. First operand 488 states and 706 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:43,809 INFO L93 Difference]: Finished difference Result 1029 states and 1478 transitions. [2025-02-06 02:27:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:27:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-02-06 02:27:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:43,813 INFO L225 Difference]: With dead ends: 1029 [2025-02-06 02:27:43,813 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 02:27:43,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:27:43,814 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 172 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:43,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 571 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 02:27:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 524. [2025-02-06 02:27:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 455 states have (on average 1.3758241758241758) internal successors, (626), 455 states have internal predecessors, (626), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 02:27:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 754 transitions. [2025-02-06 02:27:43,838 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 754 transitions. Word has length 117 [2025-02-06 02:27:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 754 transitions. [2025-02-06 02:27:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 754 transitions. [2025-02-06 02:27:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 02:27:43,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:43,840 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:27:43,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 170186779, now seen corresponding path program 1 times [2025-02-06 02:27:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904310443] [2025-02-06 02:27:43,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 02:27:43,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 02:27:43,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904310443] [2025-02-06 02:27:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904310443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:27:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172169015] [2025-02-06 02:27:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:44,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:27:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:44,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:27:44,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:27:44,008 INFO L87 Difference]: Start difference. First operand 524 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:44,298 INFO L93 Difference]: Finished difference Result 1087 states and 1562 transitions. [2025-02-06 02:27:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:27:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-02-06 02:27:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:44,301 INFO L225 Difference]: With dead ends: 1087 [2025-02-06 02:27:44,302 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 02:27:44,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:27:44,304 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 174 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:44,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 864 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 02:27:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 644. [2025-02-06 02:27:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 557 states have (on average 1.3644524236983842) internal successors, (760), 559 states have internal predecessors, (760), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 02:27:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 920 transitions. [2025-02-06 02:27:44,340 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 920 transitions. Word has length 117 [2025-02-06 02:27:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:44,340 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 920 transitions. [2025-02-06 02:27:44,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 920 transitions. [2025-02-06 02:27:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:44,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:44,343 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:44,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:27:44,343 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:44,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -794895370, now seen corresponding path program 1 times [2025-02-06 02:27:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147183415] [2025-02-06 02:27:44,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:44,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:44,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:44,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:44,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147183415] [2025-02-06 02:27:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147183415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:27:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427444002] [2025-02-06 02:27:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:27:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:44,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:27:44,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:44,671 INFO L87 Difference]: Start difference. First operand 644 states and 920 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:44,879 INFO L93 Difference]: Finished difference Result 860 states and 1219 transitions. [2025-02-06 02:27:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:27:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:44,884 INFO L225 Difference]: With dead ends: 860 [2025-02-06 02:27:44,884 INFO L226 Difference]: Without dead ends: 858 [2025-02-06 02:27:44,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:27:44,886 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 65 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:44,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 690 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-02-06 02:27:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 854. [2025-02-06 02:27:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 732 states have (on average 1.349726775956284) internal successors, (988), 737 states have internal predecessors, (988), 112 states have call successors, (112), 9 states have call predecessors, (112), 9 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:27:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1212 transitions. [2025-02-06 02:27:44,923 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1212 transitions. Word has length 118 [2025-02-06 02:27:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:44,923 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1212 transitions. [2025-02-06 02:27:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1212 transitions. [2025-02-06 02:27:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:44,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:44,924 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:44,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:27:44,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:44,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2021929447, now seen corresponding path program 1 times [2025-02-06 02:27:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536888020] [2025-02-06 02:27:44,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:44,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:44,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:44,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536888020] [2025-02-06 02:27:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536888020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826462576] [2025-02-06 02:27:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:27:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:44,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:27:44,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:27:44,982 INFO L87 Difference]: Start difference. First operand 854 states and 1212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:45,047 INFO L93 Difference]: Finished difference Result 1884 states and 2659 transitions. [2025-02-06 02:27:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:27:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:45,053 INFO L225 Difference]: With dead ends: 1884 [2025-02-06 02:27:45,053 INFO L226 Difference]: Without dead ends: 1243 [2025-02-06 02:27:45,055 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-02-06 02:27:45,055 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 51 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:45,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-02-06 02:27:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1236. [2025-02-06 02:27:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1085 states have (on average 1.3317972350230414) internal successors, (1445), 1095 states have internal predecessors, (1445), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 02:27:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1709 transitions. [2025-02-06 02:27:45,107 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1709 transitions. Word has length 118 [2025-02-06 02:27:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:45,108 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1709 transitions. [2025-02-06 02:27:45,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1709 transitions. [2025-02-06 02:27:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:45,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:45,110 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:45,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:27:45,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1900712041, now seen corresponding path program 1 times [2025-02-06 02:27:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:45,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708841281] [2025-02-06 02:27:45,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:45,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:45,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:45,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708841281] [2025-02-06 02:27:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708841281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:27:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336406141] [2025-02-06 02:27:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:27:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:45,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:27:45,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:45,743 INFO L87 Difference]: Start difference. First operand 1236 states and 1709 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:46,694 INFO L93 Difference]: Finished difference Result 2791 states and 3825 transitions. [2025-02-06 02:27:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:27:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:46,705 INFO L225 Difference]: With dead ends: 2791 [2025-02-06 02:27:46,706 INFO L226 Difference]: Without dead ends: 1876 [2025-02-06 02:27:46,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:46,708 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 39 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:46,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 651 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:27:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-02-06 02:27:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1861. [2025-02-06 02:27:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1671 states have (on average 1.305804907241173) internal successors, (2182), 1694 states have internal predecessors, (2182), 158 states have call successors, (158), 31 states have call predecessors, (158), 31 states have return successors, (158), 135 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:27:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2498 transitions. [2025-02-06 02:27:46,800 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2498 transitions. Word has length 118 [2025-02-06 02:27:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:46,801 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 2498 transitions. [2025-02-06 02:27:46,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2498 transitions. [2025-02-06 02:27:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:46,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:46,803 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:27:46,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash -393160232, now seen corresponding path program 1 times [2025-02-06 02:27:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603496167] [2025-02-06 02:27:46,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:46,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:46,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:47,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603496167] [2025-02-06 02:27:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603496167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:27:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446225069] [2025-02-06 02:27:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:47,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:27:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:47,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:27:47,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:27:47,402 INFO L87 Difference]: Start difference. First operand 1861 states and 2498 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:48,097 INFO L93 Difference]: Finished difference Result 3870 states and 5223 transitions. [2025-02-06 02:27:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:27:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:48,107 INFO L225 Difference]: With dead ends: 3870 [2025-02-06 02:27:48,107 INFO L226 Difference]: Without dead ends: 2495 [2025-02-06 02:27:48,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:48,110 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:48,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 776 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:27:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-02-06 02:27:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2239. [2025-02-06 02:27:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2022 states have (on average 1.2982195845697329) internal successors, (2625), 2046 states have internal predecessors, (2625), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 156 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 02:27:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 2985 transitions. [2025-02-06 02:27:48,258 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 2985 transitions. Word has length 118 [2025-02-06 02:27:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 2985 transitions. [2025-02-06 02:27:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2985 transitions. [2025-02-06 02:27:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:48,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:48,260 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:48,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:27:48,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1626704646, now seen corresponding path program 1 times [2025-02-06 02:27:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61761905] [2025-02-06 02:27:48,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:48,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:48,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:48,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61761905] [2025-02-06 02:27:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61761905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:27:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85047329] [2025-02-06 02:27:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:27:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:48,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:27:48,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:27:48,367 INFO L87 Difference]: Start difference. First operand 2239 states and 2985 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:48,638 INFO L93 Difference]: Finished difference Result 4424 states and 5942 transitions. [2025-02-06 02:27:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:27:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:48,648 INFO L225 Difference]: With dead ends: 4424 [2025-02-06 02:27:48,648 INFO L226 Difference]: Without dead ends: 2812 [2025-02-06 02:27:48,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:27:48,650 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 61 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:48,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 492 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-02-06 02:27:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2670. [2025-02-06 02:27:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2407 states have (on average 1.2924802658911507) internal successors, (3111), 2440 states have internal predecessors, (3111), 214 states have call successors, (214), 48 states have call predecessors, (214), 48 states have return successors, (214), 181 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 02:27:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3539 transitions. [2025-02-06 02:27:48,788 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3539 transitions. Word has length 118 [2025-02-06 02:27:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:48,788 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 3539 transitions. [2025-02-06 02:27:48,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3539 transitions. [2025-02-06 02:27:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 02:27:48,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:48,790 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:27:48,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 188340256, now seen corresponding path program 1 times [2025-02-06 02:27:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670919815] [2025-02-06 02:27:48,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:48,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 02:27:48,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 02:27:48,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670919815] [2025-02-06 02:27:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670919815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:48,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:48,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542051549] [2025-02-06 02:27:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:48,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:27:48,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:27:48,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:27:48,835 INFO L87 Difference]: Start difference. First operand 2670 states and 3539 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:48,964 INFO L93 Difference]: Finished difference Result 4596 states and 6114 transitions. [2025-02-06 02:27:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:27:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 02:27:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:48,973 INFO L225 Difference]: With dead ends: 4596 [2025-02-06 02:27:48,973 INFO L226 Difference]: Without dead ends: 2408 [2025-02-06 02:27:48,977 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-02-06 02:27:48,977 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:48,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-02-06 02:27:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2199. [2025-02-06 02:27:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1975 states have (on average 1.2551898734177216) internal successors, (2479), 1997 states have internal predecessors, (2479), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 02:27:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2839 transitions. [2025-02-06 02:27:49,108 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 2839 transitions. Word has length 118 [2025-02-06 02:27:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:49,108 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 2839 transitions. [2025-02-06 02:27:49,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2839 transitions. [2025-02-06 02:27:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 02:27:49,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:49,111 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:49,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:27:49,111 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:49,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1118124734, now seen corresponding path program 1 times [2025-02-06 02:27:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529958952] [2025-02-06 02:27:49,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:49,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 02:27:49,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 02:27:49,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:49,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529958952] [2025-02-06 02:27:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529958952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:27:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480618898] [2025-02-06 02:27:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:49,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:49,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:49,370 INFO L87 Difference]: Start difference. First operand 2199 states and 2839 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:49,730 INFO L93 Difference]: Finished difference Result 4331 states and 5630 transitions. [2025-02-06 02:27:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:27:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-02-06 02:27:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:49,739 INFO L225 Difference]: With dead ends: 4331 [2025-02-06 02:27:49,739 INFO L226 Difference]: Without dead ends: 2518 [2025-02-06 02:27:49,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:27:49,744 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 130 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:49,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 710 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2025-02-06 02:27:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2186. [2025-02-06 02:27:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1962 states have (on average 1.2512742099898064) internal successors, (2455), 1984 states have internal predecessors, (2455), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 02:27:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 2815 transitions. [2025-02-06 02:27:49,884 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 2815 transitions. Word has length 119 [2025-02-06 02:27:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:49,884 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 2815 transitions. [2025-02-06 02:27:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2815 transitions. [2025-02-06 02:27:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 02:27:49,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:49,886 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:49,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:27:49,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:49,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1769771368, now seen corresponding path program 1 times [2025-02-06 02:27:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:49,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715189831] [2025-02-06 02:27:49,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:49,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 02:27:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 02:27:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:50,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715189831] [2025-02-06 02:27:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715189831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:27:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022499070] [2025-02-06 02:27:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:50,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:27:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:50,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:27:50,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:27:50,292 INFO L87 Difference]: Start difference. First operand 2186 states and 2815 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:50,818 INFO L93 Difference]: Finished difference Result 4281 states and 5558 transitions. [2025-02-06 02:27:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:27:50,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-02-06 02:27:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:50,828 INFO L225 Difference]: With dead ends: 4281 [2025-02-06 02:27:50,828 INFO L226 Difference]: Without dead ends: 2564 [2025-02-06 02:27:50,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:27:50,832 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 178 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:50,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 605 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:27:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-02-06 02:27:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2196. [2025-02-06 02:27:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 1972 states have (on average 1.25) internal successors, (2465), 1994 states have internal predecessors, (2465), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 02:27:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2825 transitions. [2025-02-06 02:27:50,994 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2825 transitions. Word has length 119 [2025-02-06 02:27:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 2825 transitions. [2025-02-06 02:27:50,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2825 transitions. [2025-02-06 02:27:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 02:27:51,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:51,000 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:51,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 02:27:51,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:51,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1627692575, now seen corresponding path program 1 times [2025-02-06 02:27:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:51,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408945639] [2025-02-06 02:27:51,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 02:27:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 02:27:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-06 02:27:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408945639] [2025-02-06 02:27:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408945639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:27:51,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622710291] [2025-02-06 02:27:51,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:51,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:51,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:51,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:51,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:27:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 02:27:51,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 02:27:51,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:51,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:51,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 02:27:51,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-06 02:27:51,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:27:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-02-06 02:27:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622710291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:27:51,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:27:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-02-06 02:27:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122387853] [2025-02-06 02:27:51,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:27:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:27:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:51,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:27:51,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:27:51,539 INFO L87 Difference]: Start difference. First operand 2196 states and 2825 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 02:27:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:51,855 INFO L93 Difference]: Finished difference Result 4463 states and 5698 transitions. [2025-02-06 02:27:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:27:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2025-02-06 02:27:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:51,862 INFO L225 Difference]: With dead ends: 4463 [2025-02-06 02:27:51,862 INFO L226 Difference]: Without dead ends: 2312 [2025-02-06 02:27:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:27:51,865 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 222 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 228 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-02-06 02:27:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2228. [2025-02-06 02:27:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1996 states have (on average 1.2349699398797596) internal successors, (2465), 2018 states have internal predecessors, (2465), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 02:27:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2825 transitions. [2025-02-06 02:27:51,977 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2825 transitions. Word has length 119 [2025-02-06 02:27:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:51,978 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2825 transitions. [2025-02-06 02:27:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 02:27:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2825 transitions. [2025-02-06 02:27:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 02:27:51,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:51,979 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:51,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:27:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:52,182 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1382316806, now seen corresponding path program 1 times [2025-02-06 02:27:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229055499] [2025-02-06 02:27:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:52,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 02:27:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 02:27:52,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:52,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:27:52,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777222870] [2025-02-06 02:27:52,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:52,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:27:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 02:27:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 02:27:52,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:52,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:27:52,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:27:52,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 02:27:52,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 02:27:52,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:52,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:27:52,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:27:52,387 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:27:52,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:27:52,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:27:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:52,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:27:52,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:27:52,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:27:52 BoogieIcfgContainer [2025-02-06 02:27:52,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:27:52,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:27:52,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:27:52,662 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:27:52,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:34" (3/4) ... [2025-02-06 02:27:52,665 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:27:52,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:27:52,666 INFO L158 Benchmark]: Toolchain (without parser) took 19055.83ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 111.3MB in the beginning and 546.7MB in the end (delta: -435.3MB). Peak memory consumption was 197.1MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,667 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:27:52,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.43ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 98.1MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,668 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:27:52,668 INFO L158 Benchmark]: IcfgBuilder took 467.43ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 65.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,668 INFO L158 Benchmark]: TraceAbstraction took 18337.66ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 64.5MB in the beginning and 546.9MB in the end (delta: -482.4MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,669 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 771.8MB. Free memory was 546.9MB in the beginning and 546.7MB in the end (delta: 244.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:27:52,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.43ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 98.1MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 467.43ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 65.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18337.66ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 64.5MB in the beginning and 546.9MB in the end (delta: -482.4MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 771.8MB. Free memory was 546.9MB in the beginning and 546.7MB in the end (delta: 244.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90, overapproximation of shiftLeft at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=2] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2099 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2086 mSDsluCounter, 9671 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7198 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3380 IncrementalHoareTripleChecker+Invalid, 3830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 2473 mSDtfsCounter, 3380 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 399 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2670occurred in iteration=18, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 2264 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 3016 NumberOfCodeBlocks, 3016 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 10732 SizeOfPredicates, 1 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 11940/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:27:52,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:27:54,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:27:54,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:27:54,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:27:54,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:27:54,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:27:54,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:27:54,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:27:54,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:27:54,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:27:54,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:27:54,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:27:54,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:27:54,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:27:54,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:27:54,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:54,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:27:54,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2025-02-06 02:27:55,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:27:55,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:27:55,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:27:55,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:27:55,150 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:27:55,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:56,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b60591a8/c150325b1d5e47be8077591c08909771/FLAG04a0f2a70 [2025-02-06 02:27:56,808 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:27:56,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:56,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b60591a8/c150325b1d5e47be8077591c08909771/FLAG04a0f2a70 [2025-02-06 02:27:56,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b60591a8/c150325b1d5e47be8077591c08909771 [2025-02-06 02:27:56,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:27:56,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:27:56,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:56,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:27:56,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:27:56,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:56" (1/1) ... [2025-02-06 02:27:56,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:56, skipping insertion in model container [2025-02-06 02:27:56,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:56" (1/1) ... [2025-02-06 02:27:56,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:27:56,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-02-06 02:27:56,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:56,984 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:27:56,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-02-06 02:27:57,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:57,027 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:27:57,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57 WrapperNode [2025-02-06 02:27:57,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:57,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:57,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:27:57,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:27:57,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,058 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-02-06 02:27:57,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:57,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:27:57,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:27:57,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:27:57,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,076 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-02-06 02:27:57,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:27:57,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:27:57,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:27:57,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:27:57,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (1/1) ... [2025-02-06 02:27:57,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:57,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:57,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:27:57,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:27:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:27:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:27:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:27:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:27:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:27:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:27:57,197 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:27:57,199 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:27:57,370 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:27:57,370 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:27:57,376 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:27:57,376 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:27:57,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:57 BoogieIcfgContainer [2025-02-06 02:27:57,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:27:57,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:27:57,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:27:57,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:27:57,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:27:56" (1/3) ... [2025-02-06 02:27:57,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537798e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:57, skipping insertion in model container [2025-02-06 02:27:57,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:57" (2/3) ... [2025-02-06 02:27:57,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537798e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:57, skipping insertion in model container [2025-02-06 02:27:57,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:57" (3/3) ... [2025-02-06 02:27:57,383 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2025-02-06 02:27:57,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:27:57,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-32.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:27:57,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:27:57,441 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;@46cba2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:27:57,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:27:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:27:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 02:27:57,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:57,453 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:57,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1988874552, now seen corresponding path program 1 times [2025-02-06 02:27:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:27:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531700473] [2025-02-06 02:27:57,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:57,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:57,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:27:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:27:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:27:57,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:27:57,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 02:27:57,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:27:57,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:27:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531700473] [2025-02-06 02:27:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531700473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:57,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:27:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449279064] [2025-02-06 02:27:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:27:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:27:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:27:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:27:57,668 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:27:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:57,682 INFO L93 Difference]: Finished difference Result 90 states and 151 transitions. [2025-02-06 02:27:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:27:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-02-06 02:27:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:57,687 INFO L225 Difference]: With dead ends: 90 [2025-02-06 02:27:57,687 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 02:27:57,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-02-06 02:27:57,694 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:57,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 02:27:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 02:27:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 02:27:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2025-02-06 02:27:57,728 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 102 [2025-02-06 02:27:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:57,728 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2025-02-06 02:27:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 02:27:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2025-02-06 02:27:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 02:27:57,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:57,731 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:57,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:27:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:57,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash -377512248, now seen corresponding path program 1 times [2025-02-06 02:27:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:27:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530493824] [2025-02-06 02:27:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:57,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:57,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:27:57,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:27:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:27:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 02:27:58,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 02:27:58,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:27:58,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:27:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530493824] [2025-02-06 02:27:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530493824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:27:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155158959] [2025-02-06 02:27:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:27:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:27:58,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:27:58,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:27:58,269 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:58,393 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2025-02-06 02:27:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:27:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-02-06 02:27:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:58,396 INFO L225 Difference]: With dead ends: 138 [2025-02-06 02:27:58,396 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 02:27:58,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-02-06 02:27:58,397 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:58,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 02:27:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-02-06 02:27:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 02:27:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-02-06 02:27:58,421 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2025-02-06 02:27:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-02-06 02:27:58,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 02:27:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-02-06 02:27:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 02:27:58,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:58,422 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:58,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:27:58,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:58,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2110000585, now seen corresponding path program 1 times [2025-02-06 02:27:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:27:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679041429] [2025-02-06 02:27:58,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:58,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:58,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:58,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:27:58,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:27:58,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 02:27:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 02:27:58,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:58,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 02:27:58,721 INFO L279 TraceCheckSpWp]: Computing forward predicates...