./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.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 9e76c5d054d105f204a8837692fbbd2fd3cc4beaf73b3b0fb816cdb3f665df20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:11:24,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:11:24,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:11:24,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:11:24,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:11:24,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:11:24,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:11:24,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:11:24,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:11:24,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:11:24,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:11:24,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:11:24,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:11:24,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:11:24,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:11:24,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:11:24,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:24,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:24,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:11:24,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:24,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:24,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:24,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:24,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:11:24,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:11:24,358 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 -> 9e76c5d054d105f204a8837692fbbd2fd3cc4beaf73b3b0fb816cdb3f665df20 [2025-01-09 09:11:24,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:11:24,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:11:24,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:11:24,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:11:24,648 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:11:24,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:25,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9cb3fd5/19851658df5749728b3a875cfd189738/FLAGaccd3c524 [2025-01-09 09:11:26,214 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:11:26,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:26,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9cb3fd5/19851658df5749728b3a875cfd189738/FLAGaccd3c524 [2025-01-09 09:11:26,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9cb3fd5/19851658df5749728b3a875cfd189738 [2025-01-09 09:11:26,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:11:26,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:11:26,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:26,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:11:26,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:11:26,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f346ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26, skipping insertion in model container [2025-01-09 09:11:26,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:11:26,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i[913,926] [2025-01-09 09:11:26,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:26,508 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:11:26,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i[913,926] [2025-01-09 09:11:26,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:26,580 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:11:26,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26 WrapperNode [2025-01-09 09:11:26,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:26,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:26,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:11:26,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:11:26,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,655 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-01-09 09:11:26,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:26,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:11:26,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:11:26,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:11:26,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,695 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 09:11:26,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:11:26,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:11:26,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:11:26,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:11:26,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (1/1) ... [2025-01-09 09:11:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:26,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:26,772 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 09:11:26,778 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 09:11:26,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:11:26,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:11:26,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:11:26,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:11:26,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:11:26,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:11:26,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:11:26,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:11:27,308 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:11:27,309 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:11:27,319 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:11:27,320 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:11:27,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:27 BoogieIcfgContainer [2025-01-09 09:11:27,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:11:27,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:11:27,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:11:27,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:11:27,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:11:26" (1/3) ... [2025-01-09 09:11:27,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400453da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:27, skipping insertion in model container [2025-01-09 09:11:27,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:26" (2/3) ... [2025-01-09 09:11:27,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400453da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:27, skipping insertion in model container [2025-01-09 09:11:27,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:27" (3/3) ... [2025-01-09 09:11:27,330 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:27,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:11:27,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:11:27,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:11:27,424 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;@c3726ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:11:27,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:11:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:11:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:11:27,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:27,442 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:27,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:27,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash 10516899, now seen corresponding path program 1 times [2025-01-09 09:11:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469833575] [2025-01-09 09:11:27,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:11:27,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:11:27,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:27,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 09:11:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469833575] [2025-01-09 09:11:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469833575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:11:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106338081] [2025-01-09 09:11:27,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:27,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:27,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:27,803 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 09:11:27,804 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 09:11:27,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:11:28,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:11:28,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:28,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:28,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:11:28,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 09:11:28,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:11:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106338081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:11:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:11:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945635697] [2025-01-09 09:11:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:28,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:11:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:28,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:11:28,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:11:28,097 INFO L87 Difference]: Start difference. First operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:11:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:28,127 INFO L93 Difference]: Finished difference Result 134 states and 232 transitions. [2025-01-09 09:11:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:11:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-01-09 09:11:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:28,135 INFO L225 Difference]: With dead ends: 134 [2025-01-09 09:11:28,136 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 09:11:28,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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 09:11:28,145 INFO L435 NwaCegarLoop]: 101 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, 101 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 09:11:28,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 09:11:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 09:11:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:11:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-01-09 09:11:28,192 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 157 [2025-01-09 09:11:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:28,192 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-01-09 09:11:28,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:11:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-01-09 09:11:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:11:28,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:28,199 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:28,207 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 09:11:28,400 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 09:11:28,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:28,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash -785688719, now seen corresponding path program 1 times [2025-01-09 09:11:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746878745] [2025-01-09 09:11:28,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:28,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:11:28,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:11:28,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:28,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:11:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746878745] [2025-01-09 09:11:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746878745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:11:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433714708] [2025-01-09 09:11:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:28,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:11:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:28,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:11:28,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:11:28,849 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:28,919 INFO L93 Difference]: Finished difference Result 195 states and 297 transitions. [2025-01-09 09:11:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:11:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2025-01-09 09:11:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:28,926 INFO L225 Difference]: With dead ends: 195 [2025-01-09 09:11:28,926 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 09:11:28,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:11:28,931 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:28,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 196 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 09:11:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-01-09 09:11:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:11:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2025-01-09 09:11:28,968 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 157 [2025-01-09 09:11:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:28,969 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2025-01-09 09:11:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2025-01-09 09:11:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 09:11:28,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:28,971 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:28,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:11:28,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 248850955, now seen corresponding path program 1 times [2025-01-09 09:11:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646169635] [2025-01-09 09:11:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:29,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 09:11:29,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 09:11:29,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:29,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:11:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646169635] [2025-01-09 09:11:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646169635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:11:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886909996] [2025-01-09 09:11:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:11:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:29,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:11:29,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:11:29,476 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:29,731 INFO L93 Difference]: Finished difference Result 271 states and 410 transitions. [2025-01-09 09:11:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:11:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158 [2025-01-09 09:11:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:29,734 INFO L225 Difference]: With dead ends: 271 [2025-01-09 09:11:29,735 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 09:11:29,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:11:29,739 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:29,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 338 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:11:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 09:11:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2025-01-09 09:11:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:11:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2025-01-09 09:11:29,773 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 158 [2025-01-09 09:11:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2025-01-09 09:11:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2025-01-09 09:11:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 09:11:29,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:29,775 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:29,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:11:29,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:29,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1249500137, now seen corresponding path program 1 times [2025-01-09 09:11:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232976236] [2025-01-09 09:11:29,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:29,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 09:11:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 09:11:29,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:29,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:11:29,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:29,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232976236] [2025-01-09 09:11:29,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232976236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:29,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:29,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:11:29,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995115942] [2025-01-09 09:11:29,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:29,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:11:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:29,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:11:29,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:11:29,980 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:30,006 INFO L93 Difference]: Finished difference Result 265 states and 405 transitions. [2025-01-09 09:11:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:11:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-01-09 09:11:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:30,009 INFO L225 Difference]: With dead ends: 265 [2025-01-09 09:11:30,009 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 09:11:30,014 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 09:11:30,015 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 18 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 09:11:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2025-01-09 09:11:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:11:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2025-01-09 09:11:30,050 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 159 [2025-01-09 09:11:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2025-01-09 09:11:30,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2025-01-09 09:11:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 09:11:30,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:30,055 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:11:30,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:30,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -991334699, now seen corresponding path program 1 times [2025-01-09 09:11:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431410024] [2025-01-09 09:11:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:30,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 09:11:30,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 09:11:30,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:11:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431410024] [2025-01-09 09:11:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431410024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:30,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:30,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:11:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683159231] [2025-01-09 09:11:30,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:30,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:11:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:30,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:11:30,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:11:30,286 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:30,324 INFO L93 Difference]: Finished difference Result 271 states and 401 transitions. [2025-01-09 09:11:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:11:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-01-09 09:11:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:30,327 INFO L225 Difference]: With dead ends: 271 [2025-01-09 09:11:30,328 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 09:11:30,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 09:11:30,329 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:30,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 09:11:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-01-09 09:11:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 09:11:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2025-01-09 09:11:30,358 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 159 [2025-01-09 09:11:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:30,359 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2025-01-09 09:11:30,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2025-01-09 09:11:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 09:11:30,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:30,365 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:11:30,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 194436864, now seen corresponding path program 1 times [2025-01-09 09:11:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797417939] [2025-01-09 09:11:30,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:30,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:11:30,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:11:30,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:30,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 09:11:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:11:30,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797417939] [2025-01-09 09:11:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797417939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:11:30,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724891776] [2025-01-09 09:11:30,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:30,851 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 09:11:30,852 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 09:11:30,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:11:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:11:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:30,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 09:11:31,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-01-09 09:11:31,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:11:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 09:11:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724891776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:11:32,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:11:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-01-09 09:11:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825773946] [2025-01-09 09:11:32,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:11:32,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:11:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:11:32,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:11:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:11:32,022 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2025-01-09 09:11:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:32,472 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2025-01-09 09:11:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:11:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) Word has length 160 [2025-01-09 09:11:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:32,476 INFO L225 Difference]: With dead ends: 232 [2025-01-09 09:11:32,476 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 09:11:32,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:11:32,481 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 228 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:32,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 206 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:11:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 09:11:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2025-01-09 09:11:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 92 states have internal predecessors, (103), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 09:11:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2025-01-09 09:11:32,514 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 160 [2025-01-09 09:11:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:32,515 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2025-01-09 09:11:32,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2025-01-09 09:11:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2025-01-09 09:11:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 09:11:32,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:32,517 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:32,526 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 09:11:32,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:32,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:32,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1065816917, now seen corresponding path program 1 times [2025-01-09 09:11:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:11:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369093393] [2025-01-09 09:11:32,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:11:32,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:11:32,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:11:32,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:32,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:11:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639828612] [2025-01-09 09:11:32,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:32,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:11:32,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:11:32,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:11:33,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:11:33,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:11:33,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:11:33,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:11:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:11:33,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:11:33,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:11:33,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:11:33,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:11:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:11:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:11:33,606 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:11:33,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:11:33,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:11:33 BoogieIcfgContainer [2025-01-09 09:11:33,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:11:33,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:11:33,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:11:33,727 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:11:33,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:27" (3/4) ... [2025-01-09 09:11:33,730 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:11:33,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:11:33,731 INFO L158 Benchmark]: Toolchain (without parser) took 7483.91ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.5MB in the beginning and 143.6MB in the end (delta: -39.1MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2025-01-09 09:11:33,732 INFO L158 Benchmark]: CDTParser took 0.26ms. 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 09:11:33,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.85ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:11:33,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.65ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 85.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:11:33,732 INFO L158 Benchmark]: Boogie Preprocessor took 77.82ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 78.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:11:33,733 INFO L158 Benchmark]: RCFGBuilder took 585.31ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 56.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:11:33,733 INFO L158 Benchmark]: TraceAbstraction took 6403.25ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.2MB in the beginning and 143.7MB in the end (delta: -88.5MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2025-01-09 09:11:33,733 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 335.5MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:11:33,734 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.85ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.65ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 85.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.82ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 78.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 585.31ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 56.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6403.25ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.2MB in the beginning and 143.7MB in the end (delta: -88.5MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 335.5MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 66.1kB). 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 someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned char last_1_var_1_18 = 1; [L47] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L149] isInitial = 1 [L150] FCALL initially() [L152] CALL updateLastVariables() [L141] last_1_var_1_18 = var_1_18 [L142] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L152] RET updateLastVariables() [L153] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L101] var_1_3 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L102] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L104] var_1_8 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L106] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L106] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L107] var_1_10 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L108] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L109] var_1_11 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L110] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L113] var_1_14 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L114] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L115] var_1_15 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L116] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L117] var_1_16 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L118] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L119] var_1_17 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] var_1_19 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] var_1_21 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] var_1_22 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_23 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] var_1_24 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L136] var_1_25 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L137] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] RET updateVariables() [L154] CALL step() [L51] signed long int stepLocal_1 = last_1_var_1_20; [L52] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L53] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L54] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L57] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L62] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L67] var_1_26 = var_1_16 [L68] var_1_27 = 10u [L69] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L70] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L71] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L75] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L76] COND TRUE var_1_15 >= var_1_26 [L77] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L84] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L85] COND FALSE !(! var_1_18) [L88] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L93] COND FALSE !((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L154] RET step() [L155] CALL, EXPR property() [L145-L146] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L155] RET, EXPR property() [L155] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=125, var_1_21=127, var_1_22=1, var_1_23=1, var_1_24=-510, var_1_25=-254, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 597 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1587 NumberOfCodeBlocks, 1587 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 2719 SizeOfPredicates, 4 NumberOfNonLiveVariables, 729 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10662/10800 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 09:11:33,755 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_fillercode_fillercodesize_normal_file-79.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 9e76c5d054d105f204a8837692fbbd2fd3cc4beaf73b3b0fb816cdb3f665df20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:11:36,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:11:36,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:11:36,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:11:36,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:11:36,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:11:36,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:11:36,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:11:36,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:11:36,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:11:36,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:11:36,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:11:36,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:11:36,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:11:36,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:11:36,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:36,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:36,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:36,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:11:36,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:11:36,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:11:36,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:11:36,163 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 -> 9e76c5d054d105f204a8837692fbbd2fd3cc4beaf73b3b0fb816cdb3f665df20 [2025-01-09 09:11:36,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:11:36,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:11:36,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:11:36,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:11:36,481 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:11:36,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:37,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d0088b3/a651bb40e72949a2860d1301dea45a38/FLAGeba49297f [2025-01-09 09:11:38,101 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:11:38,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:38,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d0088b3/a651bb40e72949a2860d1301dea45a38/FLAGeba49297f [2025-01-09 09:11:38,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d0088b3/a651bb40e72949a2860d1301dea45a38 [2025-01-09 09:11:38,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:11:38,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:11:38,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:38,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:11:38,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:11:38,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3097fd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38, skipping insertion in model container [2025-01-09 09:11:38,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:11:38,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i[913,926] [2025-01-09 09:11:38,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:38,677 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:11:38,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-79.i[913,926] [2025-01-09 09:11:38,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:11:38,730 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:11:38,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38 WrapperNode [2025-01-09 09:11:38,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:11:38,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:38,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:11:38,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:11:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,792 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-01-09 09:11:38,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:11:38,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:11:38,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:11:38,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:11:38,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,842 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 09:11:38,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:11:38,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:11:38,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:11:38,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:11:38,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (1/1) ... [2025-01-09 09:11:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:11:38,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:11:38,921 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 09:11:38,927 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 09:11:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:11:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:11:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:11:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:11:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:11:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:11:39,042 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:11:39,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:11:47,626 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:11:47,626 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:11:47,635 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:11:47,636 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:11:47,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:47 BoogieIcfgContainer [2025-01-09 09:11:47,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:11:47,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:11:47,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:11:47,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:11:47,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:11:38" (1/3) ... [2025-01-09 09:11:47,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:47, skipping insertion in model container [2025-01-09 09:11:47,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:11:38" (2/3) ... [2025-01-09 09:11:47,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:11:47, skipping insertion in model container [2025-01-09 09:11:47,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:11:47" (3/3) ... [2025-01-09 09:11:47,646 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-79.i [2025-01-09 09:11:47,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:11:47,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:11:47,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:11:47,740 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;@132dc834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:11:47,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:11:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:11:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:11:47,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:47,755 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:47,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 10516899, now seen corresponding path program 1 times [2025-01-09 09:11:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054670785] [2025-01-09 09:11:47,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:47,769 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 09:11:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:47,773 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 09:11:47,775 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 09:11:47,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:11:48,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:11:48,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:48,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:11:48,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-01-09 09:11:48,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:11:48,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:11:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054670785] [2025-01-09 09:11:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054670785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:48,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:11:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480455484] [2025-01-09 09:11:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:11:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:11:48,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:11:48,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:11:48,325 INFO L87 Difference]: Start difference. First operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:11:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:48,353 INFO L93 Difference]: Finished difference Result 134 states and 232 transitions. [2025-01-09 09:11:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:11:48,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-01-09 09:11:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:48,364 INFO L225 Difference]: With dead ends: 134 [2025-01-09 09:11:48,364 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 09:11:48,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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 09:11:48,373 INFO L435 NwaCegarLoop]: 101 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, 101 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 09:11:48,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:11:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 09:11:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 09:11:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:11:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-01-09 09:11:48,427 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 157 [2025-01-09 09:11:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-01-09 09:11:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:11:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-01-09 09:11:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 09:11:48,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:48,430 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:48,448 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 09:11:48,631 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 09:11:48,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:48,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -785688719, now seen corresponding path program 1 times [2025-01-09 09:11:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672229544] [2025-01-09 09:11:48,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:48,635 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 09:11:48,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:48,639 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 09:11:48,640 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 09:11:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 09:11:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 09:11:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:11:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:11:49,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 09:11:49,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:11:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:11:50,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:11:50,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:11:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672229544] [2025-01-09 09:11:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672229544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:11:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:11:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:11:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084091995] [2025-01-09 09:11:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:11:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:11:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:11:50,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:11:50,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:11:50,796 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:55,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:11:59,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:11:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:11:59,549 INFO L93 Difference]: Finished difference Result 209 states and 317 transitions. [2025-01-09 09:11:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:11:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2025-01-09 09:11:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:11:59,553 INFO L225 Difference]: With dead ends: 209 [2025-01-09 09:11:59,553 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 09:11:59,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:11:59,554 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 81 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:11:59,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 338 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 09:11:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 09:11:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2025-01-09 09:11:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:11:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2025-01-09 09:11:59,593 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 157 [2025-01-09 09:11:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:11:59,593 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2025-01-09 09:11:59,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:11:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2025-01-09 09:11:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 09:11:59,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:11:59,598 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:59,612 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 (3)] Ended with exit code 0 [2025-01-09 09:11:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 09:11:59,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:11:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:11:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1249500137, now seen corresponding path program 1 times [2025-01-09 09:11:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:11:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648097705] [2025-01-09 09:11:59,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:11:59,800 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 09:11:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:11:59,802 INFO L229 MonitoredProcess]: Starting monitored process 4 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 09:11:59,804 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 (4)] Waiting until timeout for monitored process [2025-01-09 09:11:59,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 09:12:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 09:12:00,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:00,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 09:12:00,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:12:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:12:01,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:12:01,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:12:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648097705] [2025-01-09 09:12:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648097705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:12:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:12:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:12:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591882090] [2025-01-09 09:12:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:12:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:12:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:12:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:12:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:12:01,510 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:12:05,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:09,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:10,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:12:11,063 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2025-01-09 09:12:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:12:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-01-09 09:12:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:12:11,069 INFO L225 Difference]: With dead ends: 332 [2025-01-09 09:12:11,069 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 09:12:11,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:12:11,073 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:12:11,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 325 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2025-01-09 09:12:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 09:12:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 178. [2025-01-09 09:12:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 99 states have internal predecessors, (118), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:12:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions. [2025-01-09 09:12:11,108 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 159 [2025-01-09 09:12:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:12:11,108 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 268 transitions. [2025-01-09 09:12:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:12:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions. [2025-01-09 09:12:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 09:12:11,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:12:11,111 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:11,127 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 (4)] Ended with exit code 0 [2025-01-09 09:12:11,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 09:12:11,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:12:11,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:12:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash -991334699, now seen corresponding path program 1 times [2025-01-09 09:12:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:12:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135761485] [2025-01-09 09:12:11,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:12:11,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 09:12:11,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:12:11,315 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:12:11,319 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 (5)] Waiting until timeout for monitored process [2025-01-09 09:12:11,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 09:12:11,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 09:12:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:11,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:12:11,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:12:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:12:11,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:12:11,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:12:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135761485] [2025-01-09 09:12:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135761485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:12:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:12:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:12:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709518741] [2025-01-09 09:12:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:12:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:12:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:12:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:12:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:12:11,792 INFO L87 Difference]: Start difference. First operand 178 states and 268 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:12:15,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:12:15,589 INFO L93 Difference]: Finished difference Result 312 states and 466 transitions. [2025-01-09 09:12:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:12:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-01-09 09:12:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:12:15,592 INFO L225 Difference]: With dead ends: 312 [2025-01-09 09:12:15,593 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 09:12:15,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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 09:12:15,594 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:12:15,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 09:12:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 09:12:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-09 09:12:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 105 states have (on average 1.161904761904762) internal successors, (122), 105 states have internal predecessors, (122), 75 states have call successors, (75), 5 states have call predecessors, (75), 5 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:12:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2025-01-09 09:12:15,624 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 159 [2025-01-09 09:12:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:12:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2025-01-09 09:12:15,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:12:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2025-01-09 09:12:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 09:12:15,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:12:15,632 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:15,649 INFO L540 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 09:12:15,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 09:12:15,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:12:15,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:12:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash 194436864, now seen corresponding path program 1 times [2025-01-09 09:12:15,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:12:15,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183112974] [2025-01-09 09:12:15,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:12:15,834 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 09:12:15,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:12:15,836 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:12:15,837 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 (6)] Waiting until timeout for monitored process [2025-01-09 09:12:15,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:12:16,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:12:16,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:16,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:16,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:12:16,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:12:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-01-09 09:12:16,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:12:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 09:12:17,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:12:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183112974] [2025-01-09 09:12:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183112974] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:12:17,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:12:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-01-09 09:12:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262529336] [2025-01-09 09:12:17,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:12:17,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:12:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:12:17,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:12:17,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:12:17,571 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 09:12:22,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:12:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:12:22,512 INFO L93 Difference]: Finished difference Result 282 states and 397 transitions. [2025-01-09 09:12:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:12:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 160 [2025-01-09 09:12:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:12:22,560 INFO L225 Difference]: With dead ends: 282 [2025-01-09 09:12:22,560 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 09:12:22,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:12:22,561 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:12:22,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 146 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 09:12:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 09:12:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2025-01-09 09:12:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.131578947368421) internal successors, (129), 114 states have internal predecessors, (129), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:12:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 279 transitions. [2025-01-09 09:12:22,594 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 279 transitions. Word has length 160 [2025-01-09 09:12:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:12:22,594 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 279 transitions. [2025-01-09 09:12:22,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 09:12:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 279 transitions. [2025-01-09 09:12:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 09:12:22,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:12:22,597 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:22,614 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 (6)] Ended with exit code 0 [2025-01-09 09:12:22,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 09:12:22,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:12:22,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:12:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1065816917, now seen corresponding path program 1 times [2025-01-09 09:12:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:12:22,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865005523] [2025-01-09 09:12:22,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:12:22,799 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 09:12:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:12:22,802 INFO L229 MonitoredProcess]: Starting monitored process 7 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 09:12:22,805 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 (7)] Waiting until timeout for monitored process [2025-01-09 09:12:22,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 09:12:23,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 09:12:23,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:12:23,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:12:23,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 09:12:23,243 INFO L279 TraceCheckSpWp]: Computing forward predicates...