./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.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 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:02:58,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:02:58,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:02:58,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:02:58,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:02:58,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:02:58,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:02:58,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:02:58,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:02:58,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:02:58,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:02:58,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:02:58,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:02:58,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:02:58,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:02:58,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:58,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:58,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:58,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:02:58,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:02:58,096 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 -> 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 [2025-01-09 09:02:58,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:02:58,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:02:58,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:02:58,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:02:58,332 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:02:58,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:02:59,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faf29dcd7/a2c241a1f44c43059be163619030a38a/FLAG37c24b886 [2025-01-09 09:02:59,780 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:02:59,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:02:59,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faf29dcd7/a2c241a1f44c43059be163619030a38a/FLAG37c24b886 [2025-01-09 09:03:00,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faf29dcd7/a2c241a1f44c43059be163619030a38a [2025-01-09 09:03:00,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:03:00,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:03:00,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:03:00,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:03:00,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:03:00,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00, skipping insertion in model container [2025-01-09 09:03:00,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:03:00,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-01-09 09:03:00,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:03:00,296 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:03:00,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-01-09 09:03:00,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:03:00,356 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:03:00,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00 WrapperNode [2025-01-09 09:03:00,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:03:00,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:03:00,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:03:00,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:03:00,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,400 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-01-09 09:03:00,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:03:00,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:03:00,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:03:00,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:03:00,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:03:00,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:03:00,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:03:00,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:03:00,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:03:00,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (1/1) ... [2025-01-09 09:03:00,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:03:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:03:00,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:03:00,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:03:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:03:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:03:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:03:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:03:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:03:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:03:00,539 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:03:00,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:03:00,805 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 09:03:00,805 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:03:00,815 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:03:00,817 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:03:00,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:00 BoogieIcfgContainer [2025-01-09 09:03:00,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:03:00,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:03:00,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:03:00,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:03:00,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:00" (1/3) ... [2025-01-09 09:03:00,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3277e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:00, skipping insertion in model container [2025-01-09 09:03:00,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:00" (2/3) ... [2025-01-09 09:03:00,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3277e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:00, skipping insertion in model container [2025-01-09 09:03:00,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:00" (3/3) ... [2025-01-09 09:03:00,825 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:03:00,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:03:00,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-16.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:03:00,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:03:00,900 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;@692679e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:03:00,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:03:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 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 09:03:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:03:00,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:00,915 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] [2025-01-09 09:03:00,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:00,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 864120810, now seen corresponding path program 1 times [2025-01-09 09:03:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363811996] [2025-01-09 09:03:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:00,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:01,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:03:01,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:03:01,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:01,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:01,195 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 09:03:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363811996] [2025-01-09 09:03:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363811996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:03:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311108848] [2025-01-09 09:03:01,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:03:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:03:01,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:03:01,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:03:01,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:03:01,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:03:01,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:01,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:03:01,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:03:01,361 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 09:03:01,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:03:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311108848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:01,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:03:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:03:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181002376] [2025-01-09 09:03:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:03:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:01,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:03:01,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:03:01,382 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 09:03:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:01,400 INFO L93 Difference]: Finished difference Result 148 states and 249 transitions. [2025-01-09 09:03:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:03:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 147 [2025-01-09 09:03:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:01,406 INFO L225 Difference]: With dead ends: 148 [2025-01-09 09:03:01,407 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 09:03:01,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:03:01,412 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:01,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:03:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 09:03:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 09:03:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 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 09:03:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2025-01-09 09:03:01,443 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 147 [2025-01-09 09:03:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2025-01-09 09:03:01,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 09:03:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2025-01-09 09:03:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:03:01,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:01,471 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] [2025-01-09 09:03:01,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:03:01,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:03:01,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:01,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1315084494, now seen corresponding path program 1 times [2025-01-09 09:03:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:01,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-01-09 09:03:01,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:01,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:03:01,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:03:01,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:01,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:02,059 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 09:03:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-01-09 09:03:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989418788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:02,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:03:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:03:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731314033] [2025-01-09 09:03:02,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:02,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:03:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:02,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:03:02,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:03:02,064 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 09:03:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:02,232 INFO L93 Difference]: Finished difference Result 253 states and 369 transitions. [2025-01-09 09:03:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:03:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 147 [2025-01-09 09:03:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:02,235 INFO L225 Difference]: With dead ends: 253 [2025-01-09 09:03:02,235 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 09:03:02,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:03:02,240 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 185 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:02,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 416 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:03:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 09:03:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2025-01-09 09:03:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 09:03:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2025-01-09 09:03:02,254 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 147 [2025-01-09 09:03:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:02,255 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2025-01-09 09:03:02,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 09:03:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2025-01-09 09:03:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:03:02,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:02,257 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] [2025-01-09 09:03:02,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:03:02,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:02,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1391534900, now seen corresponding path program 1 times [2025-01-09 09:03:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:02,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-01-09 09:03:02,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:03:02,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:03:02,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:02,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:02,526 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 09:03:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-01-09 09:03:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894862053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:03:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:03:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108782451] [2025-01-09 09:03:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:03:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:02,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:03:02,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:03:02,529 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:03:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:02,730 INFO L93 Difference]: Finished difference Result 326 states and 476 transitions. [2025-01-09 09:03:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:03:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 147 [2025-01-09 09:03:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:02,733 INFO L225 Difference]: With dead ends: 326 [2025-01-09 09:03:02,736 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 09:03:02,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:03:02,737 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 216 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:02,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 550 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:03:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 09:03:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2025-01-09 09:03:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 148 states have internal predecessors, (208), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:03:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. [2025-01-09 09:03:02,768 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 264 transitions. Word has length 147 [2025-01-09 09:03:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:02,768 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 264 transitions. [2025-01-09 09:03:02,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:03:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2025-01-09 09:03:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 09:03:02,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:02,775 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] [2025-01-09 09:03:02,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:03:02,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:02,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1649700338, now seen corresponding path program 1 times [2025-01-09 09:03:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73425634] [2025-01-09 09:03:02,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:02,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 09:03:02,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 09:03:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:03,365 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 09:03:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73425634] [2025-01-09 09:03:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73425634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:03:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:03:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137216524] [2025-01-09 09:03:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:03:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:03,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:03:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:03:03,368 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (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 09:03:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:03,538 INFO L93 Difference]: Finished difference Result 456 states and 679 transitions. [2025-01-09 09:03:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:03:03,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (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 147 [2025-01-09 09:03:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:03,542 INFO L225 Difference]: With dead ends: 456 [2025-01-09 09:03:03,543 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 09:03:03,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:03:03,545 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 105 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:03,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 347 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:03:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 09:03:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 243. [2025-01-09 09:03:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.4619047619047618) internal successors, (307), 212 states have internal predecessors, (307), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:03:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 363 transitions. [2025-01-09 09:03:03,569 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 363 transitions. Word has length 147 [2025-01-09 09:03:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:03,570 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 363 transitions. [2025-01-09 09:03:03,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (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 09:03:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2025-01-09 09:03:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 09:03:03,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:03,586 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 09:03:03,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:03:03,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:03,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1014419918, now seen corresponding path program 1 times [2025-01-09 09:03:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526923486] [2025-01-09 09:03:03,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:03,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 09:03:03,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 09:03:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:03,770 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 09:03:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526923486] [2025-01-09 09:03:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526923486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:03:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:03:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862964142] [2025-01-09 09:03:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:03:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:03,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:03:03,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:03:03,771 INFO L87 Difference]: Start difference. First operand 243 states and 363 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 09:03:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:03,912 INFO L93 Difference]: Finished difference Result 694 states and 1023 transitions. [2025-01-09 09:03:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:03:03,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 148 [2025-01-09 09:03:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:03,915 INFO L225 Difference]: With dead ends: 694 [2025-01-09 09:03:03,915 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 09:03:03,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 09:03:03,916 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:03,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:03:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 09:03:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 390. [2025-01-09 09:03:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 325 states have (on average 1.4246153846153846) internal successors, (463), 329 states have internal predecessors, (463), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:03:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 575 transitions. [2025-01-09 09:03:03,940 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 575 transitions. Word has length 148 [2025-01-09 09:03:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 575 transitions. [2025-01-09 09:03:03,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 09:03:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 575 transitions. [2025-01-09 09:03:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 09:03:03,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:03,942 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, 1] [2025-01-09 09:03:03,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:03:03,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:03,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -315058803, now seen corresponding path program 1 times [2025-01-09 09:03:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-01-09 09:03:03,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:03:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:03:04,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 09:03:04,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:03:04,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-01-09 09:03:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061365981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:03:04,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635420595] [2025-01-09 09:03:04,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:04,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:03:04,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:03:04,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:03:04,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:03:04,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:03:04,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:03:04,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:04,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:04,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 09:03:04,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:03:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 09:03:04,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:03:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 09:03:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635420595] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:03:04,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:03:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 09:03:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449927632] [2025-01-09 09:03:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:03:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:03:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:03:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:03:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:03:04,691 INFO L87 Difference]: Start difference. First operand 390 states and 575 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 09:03:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:05,209 INFO L93 Difference]: Finished difference Result 859 states and 1238 transitions. [2025-01-09 09:03:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 09:03:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 149 [2025-01-09 09:03:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:05,212 INFO L225 Difference]: With dead ends: 859 [2025-01-09 09:03:05,213 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 09:03:05,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:03:05,214 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 349 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:05,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 473 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:03:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 09:03:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 249. [2025-01-09 09:03:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 197 states have internal predecessors, (276), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:03:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 368 transitions. [2025-01-09 09:03:05,233 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 368 transitions. Word has length 149 [2025-01-09 09:03:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 368 transitions. [2025-01-09 09:03:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 09:03:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 368 transitions. [2025-01-09 09:03:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 09:03:05,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:05,235 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, 1] [2025-01-09 09:03:05,244 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 09:03:05,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:03:05,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1567353739, now seen corresponding path program 1 times [2025-01-09 09:03:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:03:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-01-09 09:03:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:03:05,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:03:05,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:03:05,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:03:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025010335] [2025-01-09 09:03:05,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:05,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:03:05,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:03:05,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:03:05,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:03:05,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:03:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:03:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:03:05,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:03:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 09:03:05,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 09:03:05,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:05,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:03:05,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:03:05,760 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:03:05,761 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:03:05,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:03:05,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:03:05,965 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:03:06,044 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:03:06,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:03:06 BoogieIcfgContainer [2025-01-09 09:03:06,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:03:06,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:03:06,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:03:06,046 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:03:06,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:00" (3/4) ... [2025-01-09 09:03:06,049 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:03:06,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:03:06,053 INFO L158 Benchmark]: Toolchain (without parser) took 5948.70ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.3MB in the beginning and 128.2MB in the end (delta: -6.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2025-01-09 09:03:06,053 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:03:06,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.23ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 107.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:03:06,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.01ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 104.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:03:06,055 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:03:06,055 INFO L158 Benchmark]: RCFGBuilder took 378.45ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 80.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:03:06,055 INFO L158 Benchmark]: TraceAbstraction took 5227.14ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 80.2MB in the beginning and 128.2MB in the end (delta: -48.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:03:06,055 INFO L158 Benchmark]: Witness Printer took 5.97ms. Allocated memory is still 201.3MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:03:06,056 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.15ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.23ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 107.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.01ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 104.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 378.45ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 80.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5227.14ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 80.2MB in the beginning and 128.2MB in the end (delta: -48.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.97ms. Allocated memory is still 201.3MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 60.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 126, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned short int last_1_var_1_7 = 8; [L44] unsigned short int last_1_var_1_11 = 32; [L45] signed char last_1_var_1_14 = 32; [L46] unsigned short int last_1_var_1_23 = 128; VAL [isInitial=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L143] isInitial = 1 [L144] FCALL initially() [L146] CALL updateLastVariables() [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_11 = var_1_11 [L135] last_1_var_1_14 = var_1_14 [L136] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L146] RET updateLastVariables() [L147] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] var_1_5 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] var_1_6 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L107] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L108] var_1_10 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L109] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L110] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L115] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L115] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L119] var_1_17 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L120] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L121] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] 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=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L126] 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=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L128] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L129] var_1_22 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && 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=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L130] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && 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=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_0=32, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L51] COND FALSE !((last_1_var_1_23 / -50) >= stepLocal_0) [L58] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L60] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=2] [L63] COND TRUE var_1_6 > 128 [L64] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=-2147483614] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=-2147483614] [L66] signed long int stepLocal_2 = var_1_5 | var_1_6; [L67] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < stepLocal_2) [L72] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=-2147483614] [L74] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_1=32766, var_1_10=2147483646, var_1_11=65568, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=65568, var_1_9=-2147483614] [L75] COND TRUE last_1_var_1_7 < stepLocal_1 [L76] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L78] unsigned short int stepLocal_4 = var_1_8; [L79] signed long int stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_3=-2147483614, stepLocal_4=65568, var_1_10=2147483646, var_1_11=65568, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L80] COND FALSE !(stepLocal_3 < (- var_1_10)) [L85] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=65568, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L87] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=65568, stepLocal_5=65568, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L88] COND TRUE last_1_var_1_14 <= stepLocal_5 [L89] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=65568, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L91] COND TRUE var_1_4 || var_1_19 [L92] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=65568, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L139-L140] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=2147483646, var_1_11=65568, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=44, var_1_17=42, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=32798, var_1_8=65568, var_1_9=-2147483614] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 967 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 2323 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1622 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 701 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 408 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1321 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 4 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 8121/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 09:03:06,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.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 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:03:08,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:03:08,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:03:08,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:03:08,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:03:08,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:03:08,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:03:08,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:03:08,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:03:08,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:03:08,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:03:08,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:03:08,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:03:08,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:03:08,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:03:08,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:03:08,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:03:08,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:03:08,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:03:08,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:03:08,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:03:08,387 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 -> 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 [2025-01-09 09:03:08,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:03:08,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:03:08,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:03:08,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:03:08,683 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:03:08,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:03:09,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef72eb52/a23e97031c644d99a67353bf5982bf09/FLAG7a2541371 [2025-01-09 09:03:10,192 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:03:10,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:03:10,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef72eb52/a23e97031c644d99a67353bf5982bf09/FLAG7a2541371 [2025-01-09 09:03:10,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef72eb52/a23e97031c644d99a67353bf5982bf09 [2025-01-09 09:03:10,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:03:10,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:03:10,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:03:10,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:03:10,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:03:10,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75553e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10, skipping insertion in model container [2025-01-09 09:03:10,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:03:10,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-01-09 09:03:10,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:03:10,403 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:03:10,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-01-09 09:03:10,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:03:10,460 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:03:10,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10 WrapperNode [2025-01-09 09:03:10,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:03:10,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:03:10,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:03:10,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:03:10,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,502 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-01-09 09:03:10,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:03:10,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:03:10,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:03:10,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:03:10,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,533 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:03:10,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:03:10,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:03:10,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:03:10,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:03:10,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (1/1) ... [2025-01-09 09:03:10,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:03:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:03:10,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:03:10,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:03:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:03:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:03:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:03:10,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:03:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:03:10,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:03:10,669 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:03:10,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:03:11,998 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:03:11,999 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:03:12,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:03:12,005 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:03:12,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:12 BoogieIcfgContainer [2025-01-09 09:03:12,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:03:12,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:03:12,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:03:12,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:03:12,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:10" (1/3) ... [2025-01-09 09:03:12,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7c672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:12, skipping insertion in model container [2025-01-09 09:03:12,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:10" (2/3) ... [2025-01-09 09:03:12,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7c672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:12, skipping insertion in model container [2025-01-09 09:03:12,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:12" (3/3) ... [2025-01-09 09:03:12,012 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-16.i [2025-01-09 09:03:12,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:03:12,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-16.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:03:12,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:03:12,062 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;@63763f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:03:12,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:03:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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 09:03:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 09:03:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:12,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] [2025-01-09 09:03:12,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash 113026205, now seen corresponding path program 1 times [2025-01-09 09:03:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:03:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788544287] [2025-01-09 09:03:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:12,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:03:12,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:03:12,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:03:12,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 09:03:12,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 09:03:12,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 09:03:12,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:12,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:03:12,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:03:12,451 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 09:03:12,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:03:12,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:03:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788544287] [2025-01-09 09:03:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788544287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:03:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:03:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:03:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384532141] [2025-01-09 09:03:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:03:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:03:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:03:12,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:03:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:03:12,474 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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.5) internal successors, (41), 2 states have internal predecessors, (41), 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 09:03:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:12,496 INFO L93 Difference]: Finished difference Result 130 states and 221 transitions. [2025-01-09 09:03:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:03:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 144 [2025-01-09 09:03:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:12,503 INFO L225 Difference]: With dead ends: 130 [2025-01-09 09:03:12,503 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 09:03:12,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:03:12,509 INFO L435 NwaCegarLoop]: 97 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, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:12,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:03:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 09:03:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 09:03:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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 09:03:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2025-01-09 09:03:12,545 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 144 [2025-01-09 09:03:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2025-01-09 09:03:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 09:03:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2025-01-09 09:03:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 09:03:12,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:12,549 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] [2025-01-09 09:03:12,562 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 09:03:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:03:12,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 655176277, now seen corresponding path program 1 times [2025-01-09 09:03:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:03:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669377600] [2025-01-09 09:03:12,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:03:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:03:12,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:03:12,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 09:03:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 09:03:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 09:03:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:13,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 09:03:13,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:03:58,458 WARN L286 SmtUtils]: Spent 9.88s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)