./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_floatingpointinfluence_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:30:04,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:30:04,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:30:04,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:30:04,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:30:04,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:30:04,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:30:04,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:30:04,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:30:04,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:30:04,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:30:04,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:30:04,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:30:04,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:30:04,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:30:04,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:30:04,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:04,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:30:04,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:30:04,260 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2025-03-03 22:30:04,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:30:04,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:30:04,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:30:04,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:30:04,498 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:30:04,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:05,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5592e8d/38cfbb9c33f744a28ac36bb3b798a16c/FLAG076c6a6ac [2025-03-03 22:30:05,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:30:05,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:05,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5592e8d/38cfbb9c33f744a28ac36bb3b798a16c/FLAG076c6a6ac [2025-03-03 22:30:06,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5592e8d/38cfbb9c33f744a28ac36bb3b798a16c [2025-03-03 22:30:06,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:30:06,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:30:06,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:06,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:30:06,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:30:06,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06, skipping insertion in model container [2025-03-03 22:30:06,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:30:06,315 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-03 22:30:06,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:06,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:30:06,397 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-03 22:30:06,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:06,434 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:30:06,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06 WrapperNode [2025-03-03 22:30:06,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:06,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:06,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:30:06,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:30:06,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,486 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-03 22:30:06,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:06,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:30:06,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:30:06,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:30:06,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,523 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-03 22:30:06,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:30:06,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:30:06,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:30:06,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:30:06,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (1/1) ... [2025-03-03 22:30:06,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:06,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:06,572 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-03 22:30:06,575 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-03 22:30:06,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:30:06,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:30:06,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:30:06,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:30:06,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:30:06,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:30:06,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:30:06,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:30:06,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-03 22:30:06,877 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 22:30:06,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:30:06,899 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:30:06,899 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:30:06,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:06 BoogieIcfgContainer [2025-03-03 22:30:06,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:30:06,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:30:06,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:30:06,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:30:06,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:06" (1/3) ... [2025-03-03 22:30:06,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e41dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:06, skipping insertion in model container [2025-03-03 22:30:06,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:06" (2/3) ... [2025-03-03 22:30:06,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e41dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:06, skipping insertion in model container [2025-03-03 22:30:06,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:06" (3/3) ... [2025-03-03 22:30:06,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:06,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:30:06,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-86.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:30:06,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:30:06,972 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;@e8c7ec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:30:06,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:30:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 22:30:06,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:06,987 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:06,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1303684503, now seen corresponding path program 1 times [2025-03-03 22:30:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-03-03 22:30:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:07,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 22:30:07,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 22:30:07,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:07,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:30:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:30:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-03-03 22:30:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325488260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:30:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148789839] [2025-03-03 22:30:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:30:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:07,234 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-03 22:30:07,236 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-03 22:30:07,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 22:30:07,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 22:30:07,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:07,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:07,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:30:07,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:30:07,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148789839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:30:07,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:30:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160468233] [2025-03-03 22:30:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:30:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:30:07,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:30:07,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:30:07,408 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:30:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:07,431 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2025-03-03 22:30:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:30:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2025-03-03 22:30:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:07,439 INFO L225 Difference]: With dead ends: 138 [2025-03-03 22:30:07,439 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 22:30:07,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:30:07,445 INFO L435 NwaCegarLoop]: 99 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, 99 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-03 22:30:07,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 22:30:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 22:30:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2025-03-03 22:30:07,477 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 155 [2025-03-03 22:30:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2025-03-03 22:30:07,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:30:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2025-03-03 22:30:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 22:30:07,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:07,480 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:07,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:30:07,684 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-03 22:30:07,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:07,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash 196113914, now seen corresponding path program 1 times [2025-03-03 22:30:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-03-03 22:30:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:07,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 22:30:07,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 22:30:07,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:07,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:30:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:30:07,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-03-03 22:30:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244652778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:07,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:07,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:30:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453571082] [2025-03-03 22:30:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:30:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:30:07,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:30:07,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:30:07,873 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:30:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:07,914 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2025-03-03 22:30:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:30:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2025-03-03 22:30:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:07,916 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:30:07,917 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 22:30:07,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:30:07,917 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:07,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 197 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 22:30:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2025-03-03 22:30:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2025-03-03 22:30:07,933 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 155 [2025-03-03 22:30:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2025-03-03 22:30:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:30:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2025-03-03 22:30:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 22:30:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:07,938 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:30:07,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1600837445, now seen corresponding path program 1 times [2025-03-03 22:30:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841832400] [2025-03-03 22:30:07,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 22:30:08,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 22:30:08,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:30:08,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:30:08,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 22:30:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 22:30:08,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:08,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:30:08,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:30:08,132 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:30:08,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:30:08,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:30:08,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:30:08,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:30:08,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:30:08 BoogieIcfgContainer [2025-03-03 22:30:08,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:30:08,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:30:08,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:30:08,220 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:30:08,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:06" (3/4) ... [2025-03-03 22:30:08,222 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:30:08,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:30:08,224 INFO L158 Benchmark]: Toolchain (without parser) took 2028.01ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 95.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-03 22:30:08,225 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:08,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.18ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 96.5MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:30:08,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.85ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:08,227 INFO L158 Benchmark]: Boogie Preprocessor took 56.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 84.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:30:08,227 INFO L158 Benchmark]: IcfgBuilder took 354.63ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 60.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:30:08,228 INFO L158 Benchmark]: TraceAbstraction took 1318.16ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 95.0MB in the end (delta: -35.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2025-03-03 22:30:08,228 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 95.0MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:08,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.18ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 96.5MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.85ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 84.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 354.63ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 60.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.16ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 95.0MB in the end (delta: -35.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 95.0MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] float var_1_7 = 255.8; [L29] float var_1_8 = 127.8; [L30] float var_1_9 = 128.5; [L31] float var_1_10 = 499.3; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; VAL [isInitial=0, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L79] var_1_8 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L81] var_1_9 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L87] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L87] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L90] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L90] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L93] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L93] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L94] var_1_15 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L96] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L96] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L97] var_1_16 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L99] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L99] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L100] var_1_17 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L101] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L102] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L102] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L115] RET updateVariables() [L116] CALL step() [L43] COND FALSE !(! var_1_2) [L46] var_1_1 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=3, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L53] COND TRUE var_1_2 && var_1_12 [L54] var_1_11 = (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L107-L108] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L19] reach_error() VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 209 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3552/3600 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-03 22:30:08,247 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_floatingpointinfluence_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:30:10,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:30:10,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:30:10,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:30:10,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:30:10,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:30:10,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:30:10,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:30:10,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:30:10,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:30:10,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:30:10,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:30:10,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:30:10,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:30:10,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:30:10,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:30:10,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:30:10,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:30:10,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:10,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:30:10,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:30:10,130 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2025-03-03 22:30:10,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:30:10,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:30:10,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:30:10,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:30:10,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:30:10,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:11,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbea87101/6a4cb82598c24b498ed17a92335f5713/FLAGbc00226d9 [2025-03-03 22:30:11,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:30:11,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:11,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbea87101/6a4cb82598c24b498ed17a92335f5713/FLAGbc00226d9 [2025-03-03 22:30:12,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbea87101/6a4cb82598c24b498ed17a92335f5713 [2025-03-03 22:30:12,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:30:12,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:30:12,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:12,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:30:12,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:30:12,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cced38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12, skipping insertion in model container [2025-03-03 22:30:12,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:30:12,263 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-03 22:30:12,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:12,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:30:12,328 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-03 22:30:12,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:12,360 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:30:12,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12 WrapperNode [2025-03-03 22:30:12,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:12,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:12,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:30:12,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:30:12,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,394 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-03 22:30:12,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:12,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:30:12,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:30:12,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:30:12,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,424 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-03 22:30:12,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:30:12,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:30:12,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:30:12,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:30:12,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (1/1) ... [2025-03-03 22:30:12,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:12,473 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-03 22:30:12,476 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-03 22:30:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:30:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:30:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:30:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:30:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:30:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:30:12,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:30:12,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:30:13,161 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:30:13,162 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:30:13,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:30:13,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:30:13,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:13 BoogieIcfgContainer [2025-03-03 22:30:13,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:30:13,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:30:13,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:30:13,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:30:13,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:12" (1/3) ... [2025-03-03 22:30:13,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6799610e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:13, skipping insertion in model container [2025-03-03 22:30:13,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:12" (2/3) ... [2025-03-03 22:30:13,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6799610e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:13, skipping insertion in model container [2025-03-03 22:30:13,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:13" (3/3) ... [2025-03-03 22:30:13,177 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-03 22:30:13,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:30:13,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-86.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:30:13,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:30:13,231 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;@1b57c2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:30:13,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:30:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 22:30:13,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:13,241 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:13,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -187873587, now seen corresponding path program 1 times [2025-03-03 22:30:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772511941] [2025-03-03 22:30:13,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:13,252 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-03 22:30:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:13,254 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-03 22:30:13,255 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-03 22:30:13,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:30:13,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:30:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:13,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:30:13,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 22:30:13,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:13,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:30:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772511941] [2025-03-03 22:30:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772511941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:30:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450301131] [2025-03-03 22:30:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:13,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:30:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:30:13,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:30:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:30:13,585 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:30:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:13,601 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2025-03-03 22:30:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:30:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 153 [2025-03-03 22:30:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:13,607 INFO L225 Difference]: With dead ends: 120 [2025-03-03 22:30:13,607 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 22:30:13,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-03 22:30:13,615 INFO L435 NwaCegarLoop]: 88 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, 88 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-03 22:30:13,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 22:30:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 22:30:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-03-03 22:30:13,654 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 153 [2025-03-03 22:30:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-03-03 22:30:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:30:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-03-03 22:30:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 22:30:13,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:13,659 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:13,666 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-03 22:30:13,860 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-03 22:30:13,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:13,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1556622352, now seen corresponding path program 1 times [2025-03-03 22:30:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323980421] [2025-03-03 22:30:13,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:13,863 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-03 22:30:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:13,864 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-03 22:30:13,865 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-03 22:30:13,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:30:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:30:14,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:14,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:30:14,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:30:14,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:14,112 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:30:14,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323980421] [2025-03-03 22:30:14,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323980421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:30:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317118436] [2025-03-03 22:30:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:14,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:30:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:30:14,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:30:14,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:30:14,116 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:30:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:14,410 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2025-03-03 22:30:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:30:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2025-03-03 22:30:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:14,418 INFO L225 Difference]: With dead ends: 130 [2025-03-03 22:30:14,418 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 22:30:14,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:30:14,419 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:14,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:30:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 22:30:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2025-03-03 22:30:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:30:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-03 22:30:14,428 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 153 [2025-03-03 22:30:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:14,429 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-03 22:30:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:30:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-03 22:30:14,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 22:30:14,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:14,430 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:30:14,437 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-03 22:30:14,630 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-03 22:30:14,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 930890481, now seen corresponding path program 1 times [2025-03-03 22:30:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972515202] [2025-03-03 22:30:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:14,632 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-03 22:30:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:14,634 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-03 22:30:14,635 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-03 22:30:14,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:30:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:30:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:14,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 22:30:14,875 INFO L279 TraceCheckSpWp]: Computing forward predicates...