./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.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_operatoramount_amount50_file-74.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 77567dbcf729acd81a722c378b3b81940ac16fa2230b9633967d7108256fb354 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:01:49,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:01:49,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:01:49,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:01:49,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:01:49,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:01:49,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:01:49,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:01:49,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:01:49,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:01:49,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:01:49,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:01:49,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:01:49,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:01:49,838 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:01:49,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:01:49,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:01:49,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:01:49,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:01:49,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:01:49,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:01:49,840 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 -> 77567dbcf729acd81a722c378b3b81940ac16fa2230b9633967d7108256fb354 [2025-01-09 15:01:50,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:01:50,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:01:50,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:01:50,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:01:50,082 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:01:50,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i [2025-01-09 15:01:51,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/298e03612/cf7b0cfefb1448b29d97b55a57a664f4/FLAGf45b6abaf [2025-01-09 15:01:51,564 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:01:51,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i [2025-01-09 15:01:51,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/298e03612/cf7b0cfefb1448b29d97b55a57a664f4/FLAGf45b6abaf [2025-01-09 15:01:51,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/298e03612/cf7b0cfefb1448b29d97b55a57a664f4 [2025-01-09 15:01:51,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:01:51,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:01:51,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:01:51,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:01:51,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:01:51,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:01:51" (1/1) ... [2025-01-09 15:01:51,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:51, skipping insertion in model container [2025-01-09 15:01:51,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:01:51" (1/1) ... [2025-01-09 15:01:51,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:01:51,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i[915,928] [2025-01-09 15:01:52,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:01:52,017 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:01:52,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i[915,928] [2025-01-09 15:01:52,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:01:52,049 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:01:52,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52 WrapperNode [2025-01-09 15:01:52,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:01:52,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:01:52,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:01:52,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:01:52,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,077 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-01-09 15:01:52,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:01:52,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:01:52,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:01:52,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:01:52,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,101 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:01:52,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:01:52,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:01:52,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:01:52,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:01:52,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (1/1) ... [2025-01-09 15:01:52,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:01:52,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:01:52,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:01:52,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:01:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:01:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:01:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:01:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:01:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:01:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:01:52,203 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:01:52,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:01:52,425 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 15:01:52,426 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:01:52,440 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:01:52,441 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:01:52,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:01:52 BoogieIcfgContainer [2025-01-09 15:01:52,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:01:52,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:01:52,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:01:52,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:01:52,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:01:51" (1/3) ... [2025-01-09 15:01:52,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81f613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:01:52, skipping insertion in model container [2025-01-09 15:01:52,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:52" (2/3) ... [2025-01-09 15:01:52,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81f613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:01:52, skipping insertion in model container [2025-01-09 15:01:52,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:01:52" (3/3) ... [2025-01-09 15:01:52,452 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-74.i [2025-01-09 15:01:52,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:01:52,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-74.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:01:52,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:01:52,526 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;@20343af4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:01:52,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:01:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:01:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:01:52,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:52,542 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:52,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:52,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash -458736688, now seen corresponding path program 1 times [2025-01-09 15:01:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:52,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-01-09 15:01:52,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:52,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:52,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:01:52,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:01:52,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 15:01:52,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-01-09 15:01:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006311136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:01:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832445201] [2025-01-09 15:01:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:52,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:01:52,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:01:52,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:01:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:01:52,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:01:52,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:01:52,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:52,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:52,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:01:52,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:01:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 15:01:52,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:01:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832445201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:01:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:01:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:01:52,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250464951] [2025-01-09 15:01:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:01:53,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:01:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:53,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:01:53,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:01:53,014 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:01:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:53,031 INFO L93 Difference]: Finished difference Result 147 states and 245 transitions. [2025-01-09 15:01:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:01:53,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-01-09 15:01:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:53,037 INFO L225 Difference]: With dead ends: 147 [2025-01-09 15:01:53,037 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 15:01:53,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:01:53,041 INFO L435 NwaCegarLoop]: 107 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, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:53,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:01:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 15:01:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 15:01:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:01:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2025-01-09 15:01:53,069 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 145 [2025-01-09 15:01:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:53,069 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2025-01-09 15:01:53,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:01:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2025-01-09 15:01:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:01:53,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:53,073 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:53,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:01:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:01:53,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash 506300100, now seen corresponding path program 1 times [2025-01-09 15:01:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372504161] [2025-01-09 15:01:53,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:01:53,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:01:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:01:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:53,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372504161] [2025-01-09 15:01:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372504161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:01:53,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:01:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:01:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201655654] [2025-01-09 15:01:53,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:01:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:01:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:53,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:01:53,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:01:53,435 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:53,483 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2025-01-09 15:01:53,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:01:53,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-01-09 15:01:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:53,487 INFO L225 Difference]: With dead ends: 177 [2025-01-09 15:01:53,487 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:01:53,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:01:53,487 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:53,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:01:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:01:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2025-01-09 15:01:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.267605633802817) internal successors, (90), 72 states have internal predecessors, (90), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:01:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2025-01-09 15:01:53,512 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 145 [2025-01-09 15:01:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:53,512 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2025-01-09 15:01:53,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2025-01-09 15:01:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:01:53,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:53,515 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:53,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:01:53,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:53,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:53,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1186358470, now seen corresponding path program 1 times [2025-01-09 15:01:53,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:53,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707810334] [2025-01-09 15:01:53,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:53,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:01:53,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:01:53,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:53,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:01:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707810334] [2025-01-09 15:01:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707810334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:01:54,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:01:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:01:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664233923] [2025-01-09 15:01:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:01:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:01:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:54,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:01:54,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:01:54,136 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:54,399 INFO L93 Difference]: Finished difference Result 295 states and 425 transitions. [2025-01-09 15:01:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:01:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-01-09 15:01:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:54,404 INFO L225 Difference]: With dead ends: 295 [2025-01-09 15:01:54,404 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 15:01:54,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:01:54,407 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:54,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 342 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:01:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 15:01:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 151. [2025-01-09 15:01:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:01:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2025-01-09 15:01:54,439 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 145 [2025-01-09 15:01:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:54,439 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2025-01-09 15:01:54,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2025-01-09 15:01:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:01:54,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:54,441 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:01:54,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 728198265, now seen corresponding path program 1 times [2025-01-09 15:01:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628591949] [2025-01-09 15:01:54,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:54,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:01:54,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:01:54,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:01:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:55,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628591949] [2025-01-09 15:01:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628591949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:01:55,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:01:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:01:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108449734] [2025-01-09 15:01:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:01:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:01:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:55,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:01:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:01:55,019 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:55,333 INFO L93 Difference]: Finished difference Result 295 states and 424 transitions. [2025-01-09 15:01:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:01:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-01-09 15:01:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:55,336 INFO L225 Difference]: With dead ends: 295 [2025-01-09 15:01:55,337 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 15:01:55,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:01:55,338 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:55,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 398 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:01:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 15:01:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2025-01-09 15:01:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.2) internal successors, (114), 96 states have internal predecessors, (114), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:01:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2025-01-09 15:01:55,382 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 146 [2025-01-09 15:01:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:55,383 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2025-01-09 15:01:55,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2025-01-09 15:01:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:01:55,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:55,387 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:55,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:01:55,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash -292870089, now seen corresponding path program 1 times [2025-01-09 15:01:55,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334681941] [2025-01-09 15:01:55,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:55,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:01:55,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:01:55,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:55,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:01:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334681941] [2025-01-09 15:01:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334681941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:01:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:01:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:01:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802935912] [2025-01-09 15:01:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:01:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:01:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:56,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:01:56,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:01:56,079 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:56,447 INFO L93 Difference]: Finished difference Result 331 states and 475 transitions. [2025-01-09 15:01:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:01:56,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-01-09 15:01:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:56,451 INFO L225 Difference]: With dead ends: 331 [2025-01-09 15:01:56,451 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 15:01:56,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:01:56,453 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 239 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:56,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 453 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:01:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 15:01:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 220. [2025-01-09 15:01:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 143 states have (on average 1.1958041958041958) internal successors, (171), 146 states have internal predecessors, (171), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:01:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 311 transitions. [2025-01-09 15:01:56,495 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 311 transitions. Word has length 146 [2025-01-09 15:01:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 311 transitions. [2025-01-09 15:01:56,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:01:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 311 transitions. [2025-01-09 15:01:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:01:56,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:56,500 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:56,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:01:56,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash -360439640, now seen corresponding path program 1 times [2025-01-09 15:01:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425815788] [2025-01-09 15:01:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:56,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:01:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:01:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 15:01:56,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:01:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425815788] [2025-01-09 15:01:56,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425815788] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:01:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891771129] [2025-01-09 15:01:56,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:01:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:01:56,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:01:56,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:01:56,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:01:57,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:01:57,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:57,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:01:57,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:01:57,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:01:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-01-09 15:01:57,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:01:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-01-09 15:01:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891771129] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:01:58,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:01:58,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2025-01-09 15:01:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301772421] [2025-01-09 15:01:58,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:01:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 15:01:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:01:58,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 15:01:58,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2025-01-09 15:01:58,199 INFO L87 Difference]: Start difference. First operand 220 states and 311 transitions. Second operand has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2025-01-09 15:01:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:01:59,548 INFO L93 Difference]: Finished difference Result 630 states and 859 transitions. [2025-01-09 15:01:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 15:01:59,548 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 148 [2025-01-09 15:01:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:01:59,551 INFO L225 Difference]: With dead ends: 630 [2025-01-09 15:01:59,551 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 15:01:59,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=856, Invalid=2114, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 15:01:59,553 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 852 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:01:59,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 528 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:01:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 15:01:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 252. [2025-01-09 15:01:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 171 states have (on average 1.2046783625730995) internal successors, (206), 174 states have internal predecessors, (206), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:01:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 346 transitions. [2025-01-09 15:01:59,589 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 346 transitions. Word has length 148 [2025-01-09 15:01:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:01:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 346 transitions. [2025-01-09 15:01:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2025-01-09 15:01:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 346 transitions. [2025-01-09 15:01:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:01:59,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:01:59,591 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:01:59,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:01:59,792 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 15:01:59,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:01:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:01:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 319618730, now seen corresponding path program 1 times [2025-01-09 15:01:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:01:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838405746] [2025-01-09 15:01:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:01:59,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:01:59,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:01:59,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:59,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:01:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047088288] [2025-01-09 15:01:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:01:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:01:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:01:59,835 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 15:01:59,839 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 15:01:59,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:01:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:01:59,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:59,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:01:59,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:01:59,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:01:59,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:01:59,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:01:59,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:02:00,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:02:00,078 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:02:00,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:02:00,087 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 15:02:00,281 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 15:02:00,283 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:00,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:02:00,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:02:00 BoogieIcfgContainer [2025-01-09 15:02:00,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:02:00,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:02:00,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:02:00,340 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:02:00,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:01:52" (3/4) ... [2025-01-09 15:02:00,342 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:02:00,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:02:00,343 INFO L158 Benchmark]: Toolchain (without parser) took 8487.38ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.4MB in the beginning and 335.9MB in the end (delta: -230.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2025-01-09 15:02:00,343 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 125.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.99ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: Boogie Preprocessor took 32.47ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: RCFGBuilder took 326.76ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.1MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: TraceAbstraction took 7896.03ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.0MB in the beginning and 336.0MB in the end (delta: -273.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:02:00,344 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 394.3MB. Free memory was 336.0MB in the beginning and 335.9MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:02:00,345 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.19ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 125.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.99ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.47ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.76ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.1MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7896.03ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.0MB in the beginning and 336.0MB in the end (delta: -273.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 394.3MB. Free memory was 336.0MB in the beginning and 335.9MB in the end (delta: 120.0kB). 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 121, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] unsigned long int last_1_var_1_1 = 64; [L43] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] isInitial = 1 [L141] FCALL initially() [L143] CALL updateLastVariables() [L132] last_1_var_1_1 = var_1_1 [L133] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET updateLastVariables() [L144] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L97] var_1_5 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L103] var_1_9 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L109] var_1_12 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] var_1_13 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] var_1_19 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_20 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L124] var_1_21 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] var_1_22 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET updateVariables() [L145] CALL step() [L47] signed long int stepLocal_1 = last_1_var_1_11; [L48] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L50] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L54] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L56] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L67] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND FALSE !(! (var_1_11 >= var_1_11)) [L76] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_10)) [L86] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L88] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136-L137] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1285 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1285 mSDsluCounter, 2027 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1364 mSDsCounter, 583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1292 IncrementalHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 583 mSolverCounterUnsat, 663 mSDtfsCounter, 1292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 307 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1464 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1307 ConstructedInterpolants, 0 QuantifiedInterpolants, 4167 SizeOfPredicates, 4 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 8130/8316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:02:00,368 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_operatoramount_amount50_file-74.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 77567dbcf729acd81a722c378b3b81940ac16fa2230b9633967d7108256fb354 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:02:02,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:02:02,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:02:02,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:02:02,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:02:02,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:02:02,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:02:02,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:02:02,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:02:02,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:02:02,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:02:02,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:02:02,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:02:02,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:02:02,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:02:02,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:02:02,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:02:02,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:02:02,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:02:02,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:02:02,478 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:02:02,478 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:02:02,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:02:02,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:02:02,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:02:02,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:02:02,481 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 -> 77567dbcf729acd81a722c378b3b81940ac16fa2230b9633967d7108256fb354 [2025-01-09 15:02:02,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:02:02,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:02:02,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:02:02,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:02:02,745 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:02:02,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i [2025-01-09 15:02:03,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8582ca4f6/642876871e964d41b6bf02fb575baf60/FLAG4bce420d3 [2025-01-09 15:02:04,236 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:02:04,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i [2025-01-09 15:02:04,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8582ca4f6/642876871e964d41b6bf02fb575baf60/FLAG4bce420d3 [2025-01-09 15:02:04,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8582ca4f6/642876871e964d41b6bf02fb575baf60 [2025-01-09 15:02:04,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:02:04,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:02:04,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:02:04,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:02:04,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:02:04,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04, skipping insertion in model container [2025-01-09 15:02:04,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:02:04,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i[915,928] [2025-01-09 15:02:04,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:02:04,718 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:02:04,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-74.i[915,928] [2025-01-09 15:02:04,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:02:04,754 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:02:04,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04 WrapperNode [2025-01-09 15:02:04,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:02:04,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:02:04,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:02:04,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:02:04,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,797 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 15:02:04,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:02:04,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:02:04,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:02:04,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:02:04,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:02:04,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:02:04,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:02:04,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:02:04,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:02:04,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (1/1) ... [2025-01-09 15:02:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:02:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:02:04,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:02:04,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:02:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:02:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:02:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:02:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:02:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:02:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:02:04,961 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:02:04,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:02:07,831 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 15:02:07,831 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:02:07,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:02:07,839 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:02:07,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:02:07 BoogieIcfgContainer [2025-01-09 15:02:07,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:02:07,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:02:07,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:02:07,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:02:07,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:02:04" (1/3) ... [2025-01-09 15:02:07,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@851a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:02:07, skipping insertion in model container [2025-01-09 15:02:07,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:02:04" (2/3) ... [2025-01-09 15:02:07,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@851a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:02:07, skipping insertion in model container [2025-01-09 15:02:07,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:02:07" (3/3) ... [2025-01-09 15:02:07,850 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-74.i [2025-01-09 15:02:07,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:02:07,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-74.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:02:07,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:02:07,922 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;@1ff8718f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:02:07,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:02:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:02:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:02:07,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:07,932 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:07,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -821134901, now seen corresponding path program 1 times [2025-01-09 15:02:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725175627] [2025-01-09 15:02:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:07,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:02:07,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:02:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:02:08,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:02:08,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:08,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:08,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:02:08,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:02:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 15:02:08,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:02:08,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:02:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725175627] [2025-01-09 15:02:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725175627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:02:08,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:02:08,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:02:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564103730] [2025-01-09 15:02:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:02:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:02:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:02:08,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:02:08,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:02:08,315 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:02:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:02:08,334 INFO L93 Difference]: Finished difference Result 127 states and 217 transitions. [2025-01-09 15:02:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:02:08,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2025-01-09 15:02:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:02:08,339 INFO L225 Difference]: With dead ends: 127 [2025-01-09 15:02:08,339 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 15:02:08,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:02:08,343 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:02:08,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:02:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 15:02:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 15:02:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:02:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-01-09 15:02:08,368 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 141 [2025-01-09 15:02:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:02:08,368 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-01-09 15:02:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 15:02:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-01-09 15:02:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:02:08,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:08,371 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:08,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:02:08,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:08,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:08,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1110924991, now seen corresponding path program 1 times [2025-01-09 15:02:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:08,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906161081] [2025-01-09 15:02:08,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:08,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:02:08,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:02:08,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:02:08,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:02:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:08,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:02:08,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:02:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:02:09,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:02:09,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:02:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906161081] [2025-01-09 15:02:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906161081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:02:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:02:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:02:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920818124] [2025-01-09 15:02:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:02:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:02:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:02:09,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:02:09,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:02:09,666 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:02:11,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:13,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:02:13,307 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2025-01-09 15:02:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:02:13,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2025-01-09 15:02:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:02:13,329 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:02:13,329 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:02:13,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:02:13,330 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:02:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 289 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 15:02:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:02:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2025-01-09 15:02:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:02:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-01-09 15:02:13,346 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 141 [2025-01-09 15:02:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:02:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-01-09 15:02:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:02:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-01-09 15:02:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:02:13,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:13,348 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:13,363 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 15:02:13,549 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 15:02:13,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1737170166, now seen corresponding path program 1 times [2025-01-09 15:02:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549361319] [2025-01-09 15:02:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:13,554 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 15:02:13,555 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 15:02:13,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:02:13,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:02:13,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:13,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:13,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:02:13,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:02:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 15:02:14,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:02:14,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:02:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549361319] [2025-01-09 15:02:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549361319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:02:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:02:14,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:02:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496827205] [2025-01-09 15:02:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:02:14,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:02:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:02:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:02:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:02:14,577 INFO L87 Difference]: Start difference. First operand 106 states and 157 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:02:17,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:18,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:02:18,612 INFO L93 Difference]: Finished difference Result 184 states and 273 transitions. [2025-01-09 15:02:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:02:18,629 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-01-09 15:02:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:02:18,633 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:02:18,633 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:02:18,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:02:18,639 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:02:18,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 15:02:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:02:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2025-01-09 15:02:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:02:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2025-01-09 15:02:18,668 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 142 [2025-01-09 15:02:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:02:18,669 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2025-01-09 15:02:18,669 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 15:02:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2025-01-09 15:02:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:02:18,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:18,670 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:18,682 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 15:02:18,871 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 15:02:18,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:18,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1479004728, now seen corresponding path program 1 times [2025-01-09 15:02:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636467754] [2025-01-09 15:02:18,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:18,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:18,877 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 15:02:18,878 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 15:02:18,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:02:19,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:02:19,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:19,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:19,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:02:19,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:02:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-01-09 15:02:19,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:02:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 15:02:19,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:02:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636467754] [2025-01-09 15:02:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636467754] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:02:19,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:02:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 15:02:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953881122] [2025-01-09 15:02:19,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:02:19,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:02:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:02:19,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:02:19,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:02:19,574 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 15:02:22,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:02:23,080 INFO L93 Difference]: Finished difference Result 182 states and 260 transitions. [2025-01-09 15:02:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:02:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 142 [2025-01-09 15:02:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:02:23,084 INFO L225 Difference]: With dead ends: 182 [2025-01-09 15:02:23,084 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:02:23,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:02:23,088 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 58 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:02:23,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 137 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 15:02:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:02:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2025-01-09 15:02:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:02:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-01-09 15:02:23,109 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 142 [2025-01-09 15:02:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:02:23,109 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-01-09 15:02:23,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 15:02:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-01-09 15:02:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:02:23,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:23,110 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:23,123 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 15:02:23,310 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 15:02:23,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:23,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 296002634, now seen corresponding path program 1 times [2025-01-09 15:02:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:23,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793946127] [2025-01-09 15:02:23,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:23,319 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 15:02:23,320 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 15:02:23,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:02:23,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:02:23,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:23,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:23,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:02:23,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:02:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 15:02:24,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:02:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 15:02:24,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:02:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793946127] [2025-01-09 15:02:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793946127] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:02:24,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:02:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-09 15:02:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881405004] [2025-01-09 15:02:24,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:02:24,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:02:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:02:24,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:02:24,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:02:24,579 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 15:02:28,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:29,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:31,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:02:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:02:32,370 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2025-01-09 15:02:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:02:32,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 142 [2025-01-09 15:02:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:02:32,372 INFO L225 Difference]: With dead ends: 241 [2025-01-09 15:02:32,372 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 15:02:32,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:02:32,373 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 137 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:02:32,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 318 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 15:02:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 15:02:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2025-01-09 15:02:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 95 states have internal predecessors, (102), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:02:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2025-01-09 15:02:32,385 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 142 [2025-01-09 15:02:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:02:32,386 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2025-01-09 15:02:32,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 15:02:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2025-01-09 15:02:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:02:32,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:02:32,387 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:02:32,401 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 15:02:32,587 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 15:02:32,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:02:32,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:02:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 297849676, now seen corresponding path program 1 times [2025-01-09 15:02:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:02:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65891573] [2025-01-09 15:02:32,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:02:32,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:02:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:02:32,592 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 15:02:32,593 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 15:02:32,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:02:32,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:02:32,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:02:32,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:02:32,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 15:02:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:03:17,132 WARN L286 SmtUtils]: Spent 14.37s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)