./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.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 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:11:48,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:11:48,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:11:48,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:11:48,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:11:48,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:11:48,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:11:48,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:11:48,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:11:48,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:11:48,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:11:48,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:11:48,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:11:48,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:11:48,967 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:11:48,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:11:48,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:11:48,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:11:48,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:11:48,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:11:48,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:11:48,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:48,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:48,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:48,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:48,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:48,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:11:48,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:11:48,971 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 -> 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 [2025-01-09 15:11:49,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:11:49,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:11:49,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:11:49,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:11:49,245 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:11:49,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2025-01-09 15:11:50,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25b203d7c/6d07c4fb050b437d84f900015e407a5a/FLAG1b8585e4e [2025-01-09 15:11:50,925 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:11:50,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2025-01-09 15:11:50,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25b203d7c/6d07c4fb050b437d84f900015e407a5a/FLAG1b8585e4e [2025-01-09 15:11:50,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25b203d7c/6d07c4fb050b437d84f900015e407a5a [2025-01-09 15:11:50,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:11:50,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:11:50,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:50,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:11:50,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:11:50,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:50" (1/1) ... [2025-01-09 15:11:50,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67286654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:50, skipping insertion in model container [2025-01-09 15:11:50,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:50" (1/1) ... [2025-01-09 15:11:50,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:11:51,113 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_variablewrapping_normal_file-56.i[913,926] [2025-01-09 15:11:51,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:51,171 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:11:51,182 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_variablewrapping_normal_file-56.i[913,926] [2025-01-09 15:11:51,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:51,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:11:51,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51 WrapperNode [2025-01-09 15:11:51,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:51,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:51,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:11:51,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:11:51,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,268 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-01-09 15:11:51,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:51,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:11:51,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:11:51,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:11:51,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:11:51,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:11:51,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:11:51,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:11:51,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:11:51,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (1/1) ... [2025-01-09 15:11:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:11:51,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:11:51,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:11:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:11:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:11:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:11:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:11:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:11:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:11:51,442 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:11:51,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:11:51,760 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 15:11:51,761 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:11:51,770 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:11:51,770 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:11:51,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:51 BoogieIcfgContainer [2025-01-09 15:11:51,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:11:51,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:11:51,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:11:51,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:11:51,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:11:50" (1/3) ... [2025-01-09 15:11:51,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2042f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:51, skipping insertion in model container [2025-01-09 15:11:51,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:51" (2/3) ... [2025-01-09 15:11:51,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2042f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:51, skipping insertion in model container [2025-01-09 15:11:51,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:51" (3/3) ... [2025-01-09 15:11:51,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-56.i [2025-01-09 15:11:51,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:11:51,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-56.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:11:51,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:11:51,864 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;@3786cb6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:11:51,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:11:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:11:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:11:51,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:51,877 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:51,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2098408164, now seen corresponding path program 1 times [2025-01-09 15:11:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:11:51,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605355010] [2025-01-09 15:11:51,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:11:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:11:51,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:11:51,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:51,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:11:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:11:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605355010] [2025-01-09 15:11:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605355010] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:11:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843827118] [2025-01-09 15:11:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:11:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:11:52,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:11:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:11:52,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:11:52,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:11:52,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:52,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:52,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:11:52,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:11:52,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:11:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843827118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:11:52,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:11:52,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:11:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211548627] [2025-01-09 15:11:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:11:52,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:11:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:11:52,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:11:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:11:52,349 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:11:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:52,377 INFO L93 Difference]: Finished difference Result 134 states and 222 transitions. [2025-01-09 15:11:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:11:52,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-01-09 15:11:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:52,384 INFO L225 Difference]: With dead ends: 134 [2025-01-09 15:11:52,384 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 15:11:52,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:11:52,389 INFO L435 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:11:52,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:11:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 15:11:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 15:11:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:11:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-01-09 15:11:52,424 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 124 [2025-01-09 15:11:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:52,425 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-01-09 15:11:52,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:11:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-01-09 15:11:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:11:52,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:52,430 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:52,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:11:52,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:11:52,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -344534174, now seen corresponding path program 1 times [2025-01-09 15:11:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:11:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846466082] [2025-01-09 15:11:52,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:11:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:11:52,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:11:52,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:52,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:11:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:11:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846466082] [2025-01-09 15:11:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846466082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:11:55,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:11:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:11:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445199959] [2025-01-09 15:11:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:11:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:11:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:11:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:11:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:11:55,624 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:11:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:56,087 INFO L93 Difference]: Finished difference Result 206 states and 298 transitions. [2025-01-09 15:11:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:11:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-01-09 15:11:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:56,092 INFO L225 Difference]: With dead ends: 206 [2025-01-09 15:11:56,092 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 15:11:56,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:11:56,096 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 138 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:11:56,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 361 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:11:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 15:11:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2025-01-09 15:11:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:11:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-01-09 15:11:56,118 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 124 [2025-01-09 15:11:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:56,121 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-01-09 15:11:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:11:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-01-09 15:11:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:11:56,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:56,124 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:56,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:11:56,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -86368736, now seen corresponding path program 1 times [2025-01-09 15:11:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:11:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163599756] [2025-01-09 15:11:56,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:11:56,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:11:56,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:11:56,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:56,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163599756] [2025-01-09 15:12:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163599756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:12:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82703868] [2025-01-09 15:12:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:12:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:05,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:12:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:12:05,721 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:06,016 INFO L93 Difference]: Finished difference Result 204 states and 300 transitions. [2025-01-09 15:12:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:12:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-01-09 15:12:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:06,020 INFO L225 Difference]: With dead ends: 204 [2025-01-09 15:12:06,020 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:12:06,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:12:06,022 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 110 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:06,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 253 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:12:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:12:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 80. [2025-01-09 15:12:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-01-09 15:12:06,036 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 124 [2025-01-09 15:12:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:06,037 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-01-09 15:12:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-01-09 15:12:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:12:06,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:06,038 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:12:06,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -931340188, now seen corresponding path program 1 times [2025-01-09 15:12:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228727536] [2025-01-09 15:12:06,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:06,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:12:06,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:12:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228727536] [2025-01-09 15:12:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228727536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944527019] [2025-01-09 15:12:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:06,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:06,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,115 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:06,139 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2025-01-09 15:12:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:06,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2025-01-09 15:12:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:06,141 INFO L225 Difference]: With dead ends: 158 [2025-01-09 15:12:06,141 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 15:12:06,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,142 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:06,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 15:12:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 15:12:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2025-01-09 15:12:06,149 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 124 [2025-01-09 15:12:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:06,149 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2025-01-09 15:12:06,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2025-01-09 15:12:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:12:06,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:06,151 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:06,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:12:06,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:06,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash -954503942, now seen corresponding path program 1 times [2025-01-09 15:12:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45230756] [2025-01-09 15:12:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:06,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:12:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:12:06,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45230756] [2025-01-09 15:12:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45230756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:06,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144743664] [2025-01-09 15:12:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:06,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:06,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:06,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,215 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:06,252 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2025-01-09 15:12:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 15:12:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:06,254 INFO L225 Difference]: With dead ends: 187 [2025-01-09 15:12:06,254 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:12:06,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,255 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:06,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 171 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:12:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2025-01-09 15:12:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2025-01-09 15:12:06,265 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 125 [2025-01-09 15:12:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2025-01-09 15:12:06,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2025-01-09 15:12:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:12:06,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:06,266 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:06,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:12:06,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:06,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash 944191302, now seen corresponding path program 1 times [2025-01-09 15:12:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055639720] [2025-01-09 15:12:06,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:06,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:12:06,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:12:06,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:06,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055639720] [2025-01-09 15:12:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055639720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:06,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931481650] [2025-01-09 15:12:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:06,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:06,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:06,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:06,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,338 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:06,382 INFO L93 Difference]: Finished difference Result 201 states and 300 transitions. [2025-01-09 15:12:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 15:12:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:06,384 INFO L225 Difference]: With dead ends: 201 [2025-01-09 15:12:06,384 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:12:06,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:06,385 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:06,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 207 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:12:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2025-01-09 15:12:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2025-01-09 15:12:06,396 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 125 [2025-01-09 15:12:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2025-01-09 15:12:06,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2025-01-09 15:12:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:06,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:06,398 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:06,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:12:06,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:06,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1529981843, now seen corresponding path program 1 times [2025-01-09 15:12:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060135726] [2025-01-09 15:12:06,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:06,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:06,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:06,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:06,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060135726] [2025-01-09 15:12:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060135726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:12:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965606215] [2025-01-09 15:12:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:06,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:12:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:06,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:12:06,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:12:06,747 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:06,988 INFO L93 Difference]: Finished difference Result 194 states and 273 transitions. [2025-01-09 15:12:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:12:06,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:06,991 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:12:06,993 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 15:12:06,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:12:06,995 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 159 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:06,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 554 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:12:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 15:12:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2025-01-09 15:12:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:12:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2025-01-09 15:12:07,020 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 126 [2025-01-09 15:12:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:07,021 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2025-01-09 15:12:07,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2025-01-09 15:12:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:07,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:07,024 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:07,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:12:07,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:07,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1855440249, now seen corresponding path program 1 times [2025-01-09 15:12:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882126936] [2025-01-09 15:12:07,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:07,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:13,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882126936] [2025-01-09 15:12:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882126936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:12:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098829838] [2025-01-09 15:12:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:13,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:12:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:13,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:12:13,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:12:13,496 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:13,841 INFO L93 Difference]: Finished difference Result 473 states and 661 transitions. [2025-01-09 15:12:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:12:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:13,845 INFO L225 Difference]: With dead ends: 473 [2025-01-09 15:12:13,845 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 15:12:13,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:12:13,847 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 118 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:13,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 288 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:12:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 15:12:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 183. [2025-01-09 15:12:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 147 states have internal predecessors, (195), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:12:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 263 transitions. [2025-01-09 15:12:13,862 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 263 transitions. Word has length 126 [2025-01-09 15:12:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 263 transitions. [2025-01-09 15:12:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 263 transitions. [2025-01-09 15:12:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:13,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:13,864 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:13,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:12:13,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 844322999, now seen corresponding path program 1 times [2025-01-09 15:12:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793256812] [2025-01-09 15:12:13,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:13,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:13,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:13,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793256812] [2025-01-09 15:12:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793256812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:12:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141131567] [2025-01-09 15:12:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:15,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:12:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:15,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:12:15,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:12:15,291 INFO L87 Difference]: Start difference. First operand 183 states and 263 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:16,247 INFO L93 Difference]: Finished difference Result 611 states and 865 transitions. [2025-01-09 15:12:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:12:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:16,251 INFO L225 Difference]: With dead ends: 611 [2025-01-09 15:12:16,251 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 15:12:16,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:12:16,252 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:16,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 613 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:12:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 15:12:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 344. [2025-01-09 15:12:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 271 states have (on average 1.3247232472324724) internal successors, (359), 273 states have internal predecessors, (359), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 495 transitions. [2025-01-09 15:12:16,290 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 495 transitions. Word has length 126 [2025-01-09 15:12:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:16,293 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 495 transitions. [2025-01-09 15:12:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 495 transitions. [2025-01-09 15:12:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:16,295 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:16,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:12:16,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash 164264629, now seen corresponding path program 1 times [2025-01-09 15:12:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961533107] [2025-01-09 15:12:16,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:16,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:16,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:16,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:16,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:12:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961533107] [2025-01-09 15:12:16,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961533107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:12:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642594155] [2025-01-09 15:12:16,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:16,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:12:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:12:16,502 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-01-09 15:12:16,505 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-01-09 15:12:16,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:16,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:16,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:16,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:16,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:12:16,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:12:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-01-09 15:12:16,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:12:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:12:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642594155] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:12:16,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:12:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 15:12:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991235612] [2025-01-09 15:12:16,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:12:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:12:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:12:16,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:12:16,827 INFO L87 Difference]: Start difference. First operand 344 states and 495 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:12:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:17,125 INFO L93 Difference]: Finished difference Result 842 states and 1209 transitions. [2025-01-09 15:12:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:12:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 126 [2025-01-09 15:12:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:17,131 INFO L225 Difference]: With dead ends: 842 [2025-01-09 15:12:17,132 INFO L226 Difference]: Without dead ends: 501 [2025-01-09 15:12:17,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:12:17,134 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 173 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:17,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 239 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:12:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-01-09 15:12:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 310. [2025-01-09 15:12:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 237 states have internal predecessors, (304), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 440 transitions. [2025-01-09 15:12:17,181 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 440 transitions. Word has length 126 [2025-01-09 15:12:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:17,181 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 440 transitions. [2025-01-09 15:12:17,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:12:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 440 transitions. [2025-01-09 15:12:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:17,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:17,184 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:17,192 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-01-09 15:12:17,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:12:17,387 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1352397400, now seen corresponding path program 1 times [2025-01-09 15:12:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807328968] [2025-01-09 15:12:17,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:17,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:17,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:17,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:17,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807328968] [2025-01-09 15:12:17,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807328968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:17,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:17,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662318202] [2025-01-09 15:12:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:17,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:17,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:17,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:17,436 INFO L87 Difference]: Start difference. First operand 310 states and 440 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:17,472 INFO L93 Difference]: Finished difference Result 597 states and 845 transitions. [2025-01-09 15:12:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:17,476 INFO L225 Difference]: With dead ends: 597 [2025-01-09 15:12:17,476 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 15:12:17,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:17,478 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:17,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 15:12:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-01-09 15:12:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 215 states have (on average 1.255813953488372) internal successors, (270), 217 states have internal predecessors, (270), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 406 transitions. [2025-01-09 15:12:17,509 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 406 transitions. Word has length 126 [2025-01-09 15:12:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 406 transitions. [2025-01-09 15:12:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 406 transitions. [2025-01-09 15:12:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:17,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:17,516 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:17,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:12:17,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:17,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 341280150, now seen corresponding path program 1 times [2025-01-09 15:12:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474334836] [2025-01-09 15:12:17,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:17,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:17,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:20,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:20,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474334836] [2025-01-09 15:12:20,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474334836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:20,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:12:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315069259] [2025-01-09 15:12:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:20,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:12:20,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:20,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:12:20,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:12:20,169 INFO L87 Difference]: Start difference. First operand 290 states and 406 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:20,526 INFO L93 Difference]: Finished difference Result 565 states and 772 transitions. [2025-01-09 15:12:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:12:20,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:20,529 INFO L225 Difference]: With dead ends: 565 [2025-01-09 15:12:20,529 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 15:12:20,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:12:20,530 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 124 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:20,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 553 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:12:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 15:12:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 306. [2025-01-09 15:12:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 231 states have (on average 1.2640692640692641) internal successors, (292), 233 states have internal predecessors, (292), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 428 transitions. [2025-01-09 15:12:20,557 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 428 transitions. Word has length 126 [2025-01-09 15:12:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 428 transitions. [2025-01-09 15:12:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 428 transitions. [2025-01-09 15:12:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:12:20,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:20,560 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:20,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:12:20,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash -245525864, now seen corresponding path program 1 times [2025-01-09 15:12:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952661050] [2025-01-09 15:12:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:20,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:12:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:12:20,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:20,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952661050] [2025-01-09 15:12:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952661050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:12:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789281091] [2025-01-09 15:12:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:22,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:12:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:12:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:12:22,547 INFO L87 Difference]: Start difference. First operand 306 states and 428 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:22,865 INFO L93 Difference]: Finished difference Result 739 states and 1010 transitions. [2025-01-09 15:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:12:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-01-09 15:12:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:22,868 INFO L225 Difference]: With dead ends: 739 [2025-01-09 15:12:22,868 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 15:12:22,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:12:22,870 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 102 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:22,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 491 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:12:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 15:12:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 292. [2025-01-09 15:12:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 217 states have (on average 1.2442396313364055) internal successors, (270), 219 states have internal predecessors, (270), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2025-01-09 15:12:22,902 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 126 [2025-01-09 15:12:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:22,902 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2025-01-09 15:12:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2025-01-09 15:12:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:12:22,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:22,904 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:12:22,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1553179544, now seen corresponding path program 1 times [2025-01-09 15:12:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415890363] [2025-01-09 15:12:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:12:22,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:12:22,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415890363] [2025-01-09 15:12:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415890363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:22,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:22,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214491864] [2025-01-09 15:12:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:22,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:22,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:22,968 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:23,012 INFO L93 Difference]: Finished difference Result 703 states and 970 transitions. [2025-01-09 15:12:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2025-01-09 15:12:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:23,015 INFO L225 Difference]: With dead ends: 703 [2025-01-09 15:12:23,016 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 15:12:23,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:23,017 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:23,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 186 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 15:12:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 408. [2025-01-09 15:12:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 289 states have (on average 1.1903114186851211) internal successors, (344), 295 states have internal predecessors, (344), 108 states have call successors, (108), 10 states have call predecessors, (108), 10 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:12:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 560 transitions. [2025-01-09 15:12:23,061 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 560 transitions. Word has length 128 [2025-01-09 15:12:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 560 transitions. [2025-01-09 15:12:23,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 560 transitions. [2025-01-09 15:12:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:12:23,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:23,064 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:23,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:12:23,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:23,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1889867885, now seen corresponding path program 1 times [2025-01-09 15:12:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643902788] [2025-01-09 15:12:23,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:12:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:12:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:12:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:12:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643902788] [2025-01-09 15:12:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643902788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:12:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144375760] [2025-01-09 15:12:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:23,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:12:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:12:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:12:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:23,122 INFO L87 Difference]: Start difference. First operand 408 states and 560 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:23,164 INFO L93 Difference]: Finished difference Result 781 states and 1061 transitions. [2025-01-09 15:12:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:12:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2025-01-09 15:12:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:23,168 INFO L225 Difference]: With dead ends: 781 [2025-01-09 15:12:23,168 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 15:12:23,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:12:23,173 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:23,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 15:12:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 332. [2025-01-09 15:12:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 255 states have internal predecessors, (302), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:12:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 438 transitions. [2025-01-09 15:12:23,205 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 438 transitions. Word has length 128 [2025-01-09 15:12:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:23,206 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 438 transitions. [2025-01-09 15:12:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:12:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 438 transitions. [2025-01-09 15:12:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:12:23,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:23,208 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:12:23,208 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 514199567, now seen corresponding path program 1 times [2025-01-09 15:12:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:12:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395251440] [2025-01-09 15:12:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:12:23,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:12:23,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:12:23,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:23,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:12:23,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:12:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:12:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:12:23,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:23,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:12:23,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:12:23,343 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:12:23,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:12:23,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:12:23,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:23,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:12:23,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:12:23 BoogieIcfgContainer [2025-01-09 15:12:23,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:12:23,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:12:23,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:12:23,442 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:12:23,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:51" (3/4) ... [2025-01-09 15:12:23,445 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:12:23,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:12:23,446 INFO L158 Benchmark]: Toolchain (without parser) took 32487.47ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 106.4MB in the beginning and 400.7MB in the end (delta: -294.3MB). Peak memory consumption was 502.5MB. Max. memory is 16.1GB. [2025-01-09 15:12:23,446 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:12:23,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.36ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:12:23,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.40ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:12:23,447 INFO L158 Benchmark]: Boogie Preprocessor took 48.95ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:12:23,447 INFO L158 Benchmark]: RCFGBuilder took 452.81ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 63.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:12:23,448 INFO L158 Benchmark]: TraceAbstraction took 31668.44ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 62.5MB in the beginning and 400.9MB in the end (delta: -338.4MB). Peak memory consumption was 460.5MB. Max. memory is 16.1GB. [2025-01-09 15:12:23,448 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 939.5MB. Free memory was 400.9MB in the beginning and 400.7MB in the end (delta: 198.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:12:23,449 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.36ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.40ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.95ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 452.81ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 63.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31668.44ms. Allocated memory was 142.6MB in the beginning and 939.5MB in the end (delta: 796.9MB). Free memory was 62.5MB in the beginning and 400.9MB in the end (delta: -338.4MB). Peak memory consumption was 460.5MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 939.5MB. Free memory was 400.9MB in the beginning and 400.7MB in the end (delta: 198.3kB). There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] double var_1_9 = 10.5; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] double var_1_13 = 99.25; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L110] isInitial = 1 [L111] FCALL initially() [L113] CALL updateLastVariables() [L103] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=8, var_1_9=21/2] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=8, var_1_9=21/2] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_9=21/2] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_9=21/2] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L94] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L40] COND TRUE (last_1_var_1_14 >> var_1_3) >= last_1_var_1_14 [L41] var_1_1 = ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] COND FALSE !(var_1_1 >= (var_1_8 << var_1_3)) [L56] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L63] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L64] COND TRUE stepLocal_0 || var_1_16 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=21/2] [L65] COND TRUE stepLocal_1 > var_1_6 [L66] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=133] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=133] [L106] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=133] [L106-L107] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=133] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=65, var_1_8=64, var_1_9=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 16, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1259 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1242 mSDsluCounter, 4595 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3030 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1844 IncrementalHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 1565 mSDtfsCounter, 1844 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 410 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=14, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 914 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 2262 NumberOfCodeBlocks, 2262 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 9688 SizeOfPredicates, 2 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 12258/12312 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-01-09 15:12:23,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_variablewrapping_normal_file-56.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 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:12:25,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:12:25,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:12:25,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:12:25,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:12:25,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:12:25,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:12:25,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:12:25,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:12:25,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:12:25,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:12:25,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:12:25,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:12:25,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:12:25,878 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:12:25,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:12:25,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:12:25,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:12:25,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:12:25,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:12:25,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:12:25,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:12:25,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:12:25,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:12:25,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:12:25,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:12:25,882 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:12:25,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:12:25,883 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:12:25,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:12:25,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:12:25,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:12:25,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:12:25,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:12:25,884 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 -> 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 [2025-01-09 15:12:26,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:12:26,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:12:26,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:12:26,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:12:26,170 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:12:26,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2025-01-09 15:12:27,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8caad6cf5/42cbcadcf64e4ef79299ba6e57823c9f/FLAGa77687dc7 [2025-01-09 15:12:27,822 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:12:27,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2025-01-09 15:12:27,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8caad6cf5/42cbcadcf64e4ef79299ba6e57823c9f/FLAGa77687dc7 [2025-01-09 15:12:27,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8caad6cf5/42cbcadcf64e4ef79299ba6e57823c9f [2025-01-09 15:12:27,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:12:27,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:12:27,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:12:27,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:12:27,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:12:27,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:12:27" (1/1) ... [2025-01-09 15:12:27,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb27fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:27, skipping insertion in model container [2025-01-09 15:12:27,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:12:27" (1/1) ... [2025-01-09 15:12:27,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:12:28,006 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_variablewrapping_normal_file-56.i[913,926] [2025-01-09 15:12:28,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:12:28,078 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:12:28,089 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_variablewrapping_normal_file-56.i[913,926] [2025-01-09 15:12:28,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:12:28,142 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:12:28,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28 WrapperNode [2025-01-09 15:12:28,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:12:28,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:12:28,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:12:28,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:12:28,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,192 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-01-09 15:12:28,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:12:28,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:12:28,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:12:28,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:12:28,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,230 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:12:28,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:12:28,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:12:28,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:12:28,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:12:28,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (1/1) ... [2025-01-09 15:12:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:12:28,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:12:28,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:12:28,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:12:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:12:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:12:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:12:28,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:12:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:12:28,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:12:28,404 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:12:28,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:12:28,665 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:12:28,666 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:12:28,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:12:28,678 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:12:28,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:12:28 BoogieIcfgContainer [2025-01-09 15:12:28,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:12:28,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:12:28,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:12:28,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:12:28,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:12:27" (1/3) ... [2025-01-09 15:12:28,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dae0671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:12:28, skipping insertion in model container [2025-01-09 15:12:28,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:28" (2/3) ... [2025-01-09 15:12:28,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dae0671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:12:28, skipping insertion in model container [2025-01-09 15:12:28,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:12:28" (3/3) ... [2025-01-09 15:12:28,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-56.i [2025-01-09 15:12:28,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:12:28,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-56.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:12:28,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:12:28,769 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;@1ef600a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:12:28,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:12:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:12:28,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:28,783 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:28,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:28,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash 419125394, now seen corresponding path program 1 times [2025-01-09 15:12:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:12:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644207602] [2025-01-09 15:12:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:28,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:12:28,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:12:28,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:12:28,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:12:28,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:12:28,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:12:28,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:28,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:12:28,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:12:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 15:12:29,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:12:29,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:12:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644207602] [2025-01-09 15:12:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644207602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:12:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:12:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:12:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877679898] [2025-01-09 15:12:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:12:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:12:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:12:29,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:12:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:12:29,041 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:12:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:12:29,059 INFO L93 Difference]: Finished difference Result 106 states and 182 transitions. [2025-01-09 15:12:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:12:29,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2025-01-09 15:12:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:12:29,065 INFO L225 Difference]: With dead ends: 106 [2025-01-09 15:12:29,065 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 15:12:29,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:12:29,070 INFO L435 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:12:29,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:12:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 15:12:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 15:12:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:12:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2025-01-09 15:12:29,104 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 119 [2025-01-09 15:12:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:12:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2025-01-09 15:12:29,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:12:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2025-01-09 15:12:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:12:29,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:12:29,108 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:12:29,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:12:29,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:12:29,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:12:29,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:12:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash 485742932, now seen corresponding path program 1 times [2025-01-09 15:12:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:12:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469317827] [2025-01-09 15:12:29,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:12:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:12:29,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:12:29,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:12:29,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:12:29,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:12:29,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:12:29,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:12:29,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:12:29,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:12:29,475 INFO L279 TraceCheckSpWp]: Computing forward predicates...