./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:31:12,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:31:12,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:31:12,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:31:12,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:31:12,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:31:12,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:31:12,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:31:12,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:31:12,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:31:12,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:31:12,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:31:12,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:31:12,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:31:12,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:31:12,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:31:12,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:31:12,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:31:12,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:31:12,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:31:12,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:31:12,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:31:12,572 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/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 -> cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 [2025-03-16 23:31:12,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:31:12,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:31:12,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:31:12,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:31:12,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:31:12,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:13,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184e8e69/a5c5f8c6fc7f415fb258bb776c1d429d/FLAG9f1aa6ccd [2025-03-16 23:31:14,116 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:31:14,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:14,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184e8e69/a5c5f8c6fc7f415fb258bb776c1d429d/FLAG9f1aa6ccd [2025-03-16 23:31:14,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184e8e69/a5c5f8c6fc7f415fb258bb776c1d429d [2025-03-16 23:31:14,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:31:14,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:31:14,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:31:14,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:31:14,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:31:14,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427ace29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14, skipping insertion in model container [2025-03-16 23:31:14,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:31:14,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i[913,926] [2025-03-16 23:31:14,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:31:14,309 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:31:14,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i[913,926] [2025-03-16 23:31:14,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:31:14,358 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:31:14,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14 WrapperNode [2025-03-16 23:31:14,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:31:14,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:31:14,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:31:14,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:31:14,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,396 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-03-16 23:31:14,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:31:14,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:31:14,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:31:14,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:31:14,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,430 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-03-16 23:31:14,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:31:14,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:31:14,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:31:14,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:31:14,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (1/1) ... [2025-03-16 23:31:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:31:14,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:31:14,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:31:14,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:31:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:31:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:31:14,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:31:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:31:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:31:14,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:31:14,552 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:31:14,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:31:14,788 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-16 23:31:14,812 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:31:14,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:31:14,824 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:31:14,824 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:31:14,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:31:14 BoogieIcfgContainer [2025-03-16 23:31:14,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:31:14,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:31:14,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:31:14,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:31:14,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:31:14" (1/3) ... [2025-03-16 23:31:14,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f32f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:31:14, skipping insertion in model container [2025-03-16 23:31:14,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:14" (2/3) ... [2025-03-16 23:31:14,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f32f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:31:14, skipping insertion in model container [2025-03-16 23:31:14,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:31:14" (3/3) ... [2025-03-16 23:31:14,833 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:14,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:31:14,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-38.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:31:14,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:31:14,893 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;@378ce487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:31:14,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:31:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 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-03-16 23:31:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:31:14,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:14,904 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] [2025-03-16 23:31:14,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash -551582569, now seen corresponding path program 1 times [2025-03-16 23:31:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045793582] [2025-03-16 23:31:14,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:14,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:31:15,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:31:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:31:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045793582] [2025-03-16 23:31:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045793582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:31:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735922623] [2025-03-16 23:31:15,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:31:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:31:15,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:31:15,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:31:15,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:31:15,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:31:15,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:15,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:31:15,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:31:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:31:15,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:31:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735922623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:31:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:31:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549629993] [2025-03-16 23:31:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:31:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:15,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:31:15,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:31:15,325 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-03-16 23:31:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:15,343 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2025-03-16 23:31:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:31:15,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 138 [2025-03-16 23:31:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:15,350 INFO L225 Difference]: With dead ends: 129 [2025-03-16 23:31:15,350 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 23:31:15,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-03-16 23:31:15,355 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:15,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:31:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 23:31:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 23:31:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-03-16 23:31:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-16 23:31:15,381 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 138 [2025-03-16 23:31:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:15,381 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-16 23:31:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-03-16 23:31:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-16 23:31:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:31:15,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:15,383 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] [2025-03-16 23:31:15,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:31:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:31:15,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:15,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1363460643, now seen corresponding path program 1 times [2025-03-16 23:31:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466035625] [2025-03-16 23:31:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:15,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:31:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:31:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:31:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466035625] [2025-03-16 23:31:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466035625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:31:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376901653] [2025-03-16 23:31:16,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:16,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:31:16,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:16,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:31:16,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:31:16,093 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-16 23:31:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:16,299 INFO L93 Difference]: Finished difference Result 248 states and 380 transitions. [2025-03-16 23:31:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:31:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 138 [2025-03-16 23:31:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:16,305 INFO L225 Difference]: With dead ends: 248 [2025-03-16 23:31:16,306 INFO L226 Difference]: Without dead ends: 185 [2025-03-16 23:31:16,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:31:16,308 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 200 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:16,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 380 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:31:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-16 23:31:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 125. [2025-03-16 23:31:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:31:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2025-03-16 23:31:16,343 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 138 [2025-03-16 23:31:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:16,343 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2025-03-16 23:31:16,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-16 23:31:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2025-03-16 23:31:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 23:31:16,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:16,346 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] [2025-03-16 23:31:16,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:31:16,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -55132628, now seen corresponding path program 1 times [2025-03-16 23:31:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554870074] [2025-03-16 23:31:16,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:16,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 23:31:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 23:31:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:31:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554870074] [2025-03-16 23:31:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554870074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:16,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:31:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503292645] [2025-03-16 23:31:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:16,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:31:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:16,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:31:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:31:16,672 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-03-16 23:31:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:16,908 INFO L93 Difference]: Finished difference Result 411 states and 635 transitions. [2025-03-16 23:31:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:31:16,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 139 [2025-03-16 23:31:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:16,912 INFO L225 Difference]: With dead ends: 411 [2025-03-16 23:31:16,913 INFO L226 Difference]: Without dead ends: 287 [2025-03-16 23:31:16,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:31:16,915 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 93 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:16,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 335 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:31:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-16 23:31:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 249. [2025-03-16 23:31:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 states have internal predecessors, (210), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 23:31:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 386 transitions. [2025-03-16 23:31:16,966 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 386 transitions. Word has length 139 [2025-03-16 23:31:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:16,966 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 386 transitions. [2025-03-16 23:31:16,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-03-16 23:31:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 386 transitions. [2025-03-16 23:31:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 23:31:16,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:16,968 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] [2025-03-16 23:31:16,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:31:16,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:16,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash -560691253, now seen corresponding path program 1 times [2025-03-16 23:31:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:16,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829350663] [2025-03-16 23:31:16,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:16,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 23:31:17,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 23:31:17,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:17,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:31:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829350663] [2025-03-16 23:31:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829350663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:31:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990817587] [2025-03-16 23:31:17,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:17,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:31:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:31:17,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:31:17,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:31:17,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 23:31:17,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 23:31:17,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:17,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:17,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 23:31:17,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:31:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:31:17,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:31:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:31:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990817587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:31:17,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:31:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-16 23:31:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625178899] [2025-03-16 23:31:17,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:31:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:31:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:17,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:31:17,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:31:17,931 INFO L87 Difference]: Start difference. First operand 249 states and 386 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-16 23:31:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:18,492 INFO L93 Difference]: Finished difference Result 629 states and 962 transitions. [2025-03-16 23:31:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:31:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 139 [2025-03-16 23:31:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:18,496 INFO L225 Difference]: With dead ends: 629 [2025-03-16 23:31:18,498 INFO L226 Difference]: Without dead ends: 381 [2025-03-16 23:31:18,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:31:18,501 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 340 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:18,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 436 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:31:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-16 23:31:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 283. [2025-03-16 23:31:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 188 states have (on average 1.377659574468085) internal successors, (259), 188 states have internal predecessors, (259), 88 states have call successors, (88), 6 states have call predecessors, (88), 6 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 23:31:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2025-03-16 23:31:18,538 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 139 [2025-03-16 23:31:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2025-03-16 23:31:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-16 23:31:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2025-03-16 23:31:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 23:31:18,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:18,540 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] [2025-03-16 23:31:18,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:31:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 23:31:18,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1606931755, now seen corresponding path program 1 times [2025-03-16 23:31:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248091894] [2025-03-16 23:31:18,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 23:31:18,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 23:31:18,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:18,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:31:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548416588] [2025-03-16 23:31:18,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:18,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:31:18,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:31:18,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:31:18,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:31:18,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 23:31:18,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 23:31:18,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:18,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:31:18,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:31:18,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 23:31:18,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 23:31:18,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:18,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:31:19,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:31:19,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:31:19,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:31:19,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 23:31:19,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:31:19,245 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:31:19,324 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:31:19,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:31:19 BoogieIcfgContainer [2025-03-16 23:31:19,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:31:19,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:31:19,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:31:19,328 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:31:19,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:31:14" (3/4) ... [2025-03-16 23:31:19,330 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:31:19,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:31:19,332 INFO L158 Benchmark]: Toolchain (without parser) took 5196.39ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 132.4MB in the beginning and 157.8MB in the end (delta: -25.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.87ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 116.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: IcfgBuilder took 376.35ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 94.4MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: TraceAbstraction took 4498.99ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 93.6MB in the beginning and 157.9MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:31:19,333 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 218.1MB. Free memory was 157.9MB in the beginning and 157.8MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:31:19,334 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.87ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 116.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.35ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 94.4MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4498.99ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 93.6MB in the beginning and 157.9MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 218.1MB. Free memory was 157.9MB in the beginning and 157.8MB in the end (delta: 64.6kB). 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 shiftRight at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned short int last_1_var_1_8 = 4; [L41] signed short int last_1_var_1_21 = -64; [L42] signed char last_1_var_1_25 = -128; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_21 = var_1_21 [L126] last_1_var_1_25 = var_1_25 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L89] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L93] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L93] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L94] var_1_11 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L95] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L96] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L96] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L97] var_1_12 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L99] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L99] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L100] var_1_13 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L101] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L102] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L102] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L103] var_1_15 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L104] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L105] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L105] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L106] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L107] var_1_16 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L108] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L109] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L109] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L110] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L111] var_1_17 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L113] var_1_18 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L114] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L115] var_1_19 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L117] var_1_20 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L119] var_1_26 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L120] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L121] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L121] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L137] RET updateVariables() [L138] CALL step() [L46] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L46] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L47] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L51] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L52] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=4] [L53] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L58] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L60] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L61] COND TRUE \read(var_1_4) [L62] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L65] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L72] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L74] COND TRUE (- var_1_14) <= var_1_14 [L75] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L83] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L84] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L129-L130] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=256, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 124 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 1247 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 860 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 387 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, InterpolantAutomatonStates: 30, 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, 4 MinimizatonAttempts, 196 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 2606 SizeOfPredicates, 2 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6345/6468 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-03-16 23:31:19,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:31:21,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:31:21,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:31:21,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:31:21,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:31:21,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:31:21,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:31:21,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:31:21,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:31:21,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:31:21,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:31:21,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:31:21,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:31:21,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:31:21,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:31:21,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:31:21,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:31:21,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:31:21,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:31:21,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:31:21,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:31:21,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:31:21,267 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/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 -> cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 [2025-03-16 23:31:21,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:31:21,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:31:21,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:31:21,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:31:21,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:31:21,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:22,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47e37a6b/4134a2b74d8e4910807cc3977471304a/FLAGa66c24044 [2025-03-16 23:31:22,826 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:31:22,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:22,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47e37a6b/4134a2b74d8e4910807cc3977471304a/FLAGa66c24044 [2025-03-16 23:31:22,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47e37a6b/4134a2b74d8e4910807cc3977471304a [2025-03-16 23:31:22,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:31:22,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:31:22,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:31:22,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:31:22,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:31:22,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:31:22" (1/1) ... [2025-03-16 23:31:22,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b18f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:22, skipping insertion in model container [2025-03-16 23:31:22,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:31:22" (1/1) ... [2025-03-16 23:31:22,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:31:22,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i[913,926] [2025-03-16 23:31:23,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:31:23,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:31:23,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-38.i[913,926] [2025-03-16 23:31:23,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:31:23,066 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:31:23,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23 WrapperNode [2025-03-16 23:31:23,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:31:23,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:31:23,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:31:23,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:31:23,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,113 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-16 23:31:23,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:31:23,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:31:23,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:31:23,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:31:23,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,143 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-03-16 23:31:23,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:31:23,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:31:23,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:31:23,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:31:23,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (1/1) ... [2025-03-16 23:31:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:31:23,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:31:23,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:31:23,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:31:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:31:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:31:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:31:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:31:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:31:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:31:23,288 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:31:23,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:31:27,686 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:31:27,686 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:31:27,695 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:31:27,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:31:27,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:31:27 BoogieIcfgContainer [2025-03-16 23:31:27,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:31:27,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:31:27,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:31:27,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:31:27,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:31:22" (1/3) ... [2025-03-16 23:31:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82d3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:31:27, skipping insertion in model container [2025-03-16 23:31:27,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:31:23" (2/3) ... [2025-03-16 23:31:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82d3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:31:27, skipping insertion in model container [2025-03-16 23:31:27,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:31:27" (3/3) ... [2025-03-16 23:31:27,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-38.i [2025-03-16 23:31:27,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:31:27,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-38.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:31:27,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:31:27,771 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;@26da223b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:31:27,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:31:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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-03-16 23:31:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:31:27,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:27,783 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] [2025-03-16 23:31:27,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:27,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash -721565957, now seen corresponding path program 1 times [2025-03-16 23:31:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:31:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662321495] [2025-03-16 23:31:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:27,796 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-03-16 23:31:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:31:27,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-16 23:31:27,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:31:27,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:31:28,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:31:28,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:28,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:31:28,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:31:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-16 23:31:28,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:31:28,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:31:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662321495] [2025-03-16 23:31:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662321495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:28,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:31:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247178569] [2025-03-16 23:31:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:31:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:31:28,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:31:28,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:31:28,282 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-03-16 23:31:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:28,306 INFO L93 Difference]: Finished difference Result 113 states and 202 transitions. [2025-03-16 23:31:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:31:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (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 134 [2025-03-16 23:31:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:28,314 INFO L225 Difference]: With dead ends: 113 [2025-03-16 23:31:28,314 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 23:31:28,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-03-16 23:31:28,319 INFO L435 NwaCegarLoop]: 86 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, 86 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-03-16 23:31:28,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:31:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 23:31:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-16 23:31:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-03-16 23:31:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2025-03-16 23:31:28,357 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 134 [2025-03-16 23:31:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:28,359 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-03-16 23:31:28,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (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-03-16 23:31:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2025-03-16 23:31:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:31:28,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:28,363 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] [2025-03-16 23:31:28,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:31:28,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-16 23:31:28,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -510753696, now seen corresponding path program 1 times [2025-03-16 23:31:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:31:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515943190] [2025-03-16 23:31:28,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:28,569 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-03-16 23:31:28,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:31:28,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-16 23:31:28,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:31:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:31:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:31:28,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:28,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 23:31:28,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:31:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:31:29,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:31:29,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:31:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515943190] [2025-03-16 23:31:29,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515943190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:29,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:29,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:31:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205337668] [2025-03-16 23:31:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:29,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:31:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:31:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:31:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:31:29,970 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-03-16 23:31:34,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:31:38,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:31:41,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:31:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:41,046 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2025-03-16 23:31:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:31:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 134 [2025-03-16 23:31:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:41,050 INFO L225 Difference]: With dead ends: 256 [2025-03-16 23:31:41,050 INFO L226 Difference]: Without dead ends: 201 [2025-03-16 23:31:41,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 23:31:41,051 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 144 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:41,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 459 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time] [2025-03-16 23:31:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-16 23:31:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2025-03-16 23:31:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:31:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2025-03-16 23:31:41,090 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 134 [2025-03-16 23:31:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:41,091 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2025-03-16 23:31:41,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-03-16 23:31:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2025-03-16 23:31:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 23:31:41,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:41,092 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] [2025-03-16 23:31:41,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 23:31:41,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-16 23:31:41,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:41,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1552355330, now seen corresponding path program 1 times [2025-03-16 23:31:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:31:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381107436] [2025-03-16 23:31:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:41,294 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-03-16 23:31:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:31:41,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-16 23:31:41,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:31:41,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 23:31:41,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 23:31:41,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:41,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 23:31:41,660 INFO L279 TraceCheckSpWp]: Computing forward predicates...