./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.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_fillercode_fillercodestructure_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:20:16,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:20:16,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:20:16,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:20:16,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:20:16,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:20:16,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:20:16,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:20:16,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:20:16,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:20:16,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:20:16,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:20:16,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:20:16,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:20:16,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:20:16,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:20:16,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:20:16,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:20:16,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:20:16,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:20:16,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:20:16,356 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2025-03-03 22:20:16,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:20:16,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:20:16,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:20:16,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:20:16,597 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:20:16,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:17,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e36e19d8/13cbd7d5f26e4361bd8d23fd0bdc3519/FLAGbe413fe5e [2025-03-03 22:20:17,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:20:17,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:17,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e36e19d8/13cbd7d5f26e4361bd8d23fd0bdc3519/FLAGbe413fe5e [2025-03-03 22:20:18,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e36e19d8/13cbd7d5f26e4361bd8d23fd0bdc3519 [2025-03-03 22:20:18,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:20:18,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:20:18,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:20:18,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:20:18,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:20:18,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edabbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18, skipping insertion in model container [2025-03-03 22:20:18,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:20:18,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-03-03 22:20:18,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:20:18,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:20:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-03-03 22:20:18,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:20:18,486 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:20:18,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18 WrapperNode [2025-03-03 22:20:18,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:20:18,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:20:18,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:20:18,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:20:18,493 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:20:18" (1/1) ... [2025-03-03 22:20:18,501 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:20:18" (1/1) ... [2025-03-03 22:20:18,532 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-03 22:20:18,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:20:18,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:20:18,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:20:18,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:20:18,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,553 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:20:18,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:20:18,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:20:18,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:20:18,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:20:18,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (1/1) ... [2025-03-03 22:20:18,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:20:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:20:18,598 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:20:18,601 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:20:18,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:20:18,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:20:18,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:20:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:20:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:20:18,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:20:18,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:20:18,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:20:18,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1; [2025-03-03 22:20:18,924 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:20:18,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:20:18,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:20:18,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:20:18,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:20:18 BoogieIcfgContainer [2025-03-03 22:20:18,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:20:18,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:20:18,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:20:18,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:20:18,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:20:18" (1/3) ... [2025-03-03 22:20:18,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab9864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:20:18, skipping insertion in model container [2025-03-03 22:20:18,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:18" (2/3) ... [2025-03-03 22:20:18,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab9864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:20:18, skipping insertion in model container [2025-03-03 22:20:18,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:20:18" (3/3) ... [2025-03-03 22:20:18,945 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:18,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:20:18,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-98.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:20:18,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:20:19,006 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;@256c2e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:20:19,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:20:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:20:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 22:20:19,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:19,021 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:19,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1653073215, now seen corresponding path program 1 times [2025-03-03 22:20:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:20:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376954376] [2025-03-03 22:20:19,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:20:19,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:20:19,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:20:19,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:19,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:20:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:20:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376954376] [2025-03-03 22:20:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376954376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:20:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499320446] [2025-03-03 22:20:19,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:19,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:20:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:20:19,287 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:20:19,289 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:20:19,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:20:19,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:20:19,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:19,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:19,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:20:19,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:20:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 22:20:19,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:20:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499320446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:20:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:20:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:20:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447624299] [2025-03-03 22:20:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:20:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:20:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:20:19,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:20:19,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:20:19,447 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:20:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:20:19,467 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-03-03 22:20:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:20:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-03-03 22:20:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:20:19,472 INFO L225 Difference]: With dead ends: 140 [2025-03-03 22:20:19,473 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 22:20:19,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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:20:19,476 INFO L435 NwaCegarLoop]: 104 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, 104 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:20:19,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:20:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 22:20:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 22:20:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:20:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 22:20:19,500 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 153 [2025-03-03 22:20:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:20:19,501 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 22:20:19,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:20:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 22:20:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 22:20:19,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:19,505 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,512 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:20:19,705 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:20:19,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:19,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1283932741, now seen corresponding path program 1 times [2025-03-03 22:20:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:20:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769591270] [2025-03-03 22:20:19,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:20:19,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:20:19,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:20:19,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:19,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:20:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584986902] [2025-03-03 22:20:20,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:20:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:20:20,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:20:20,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:20:20,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:20:20,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:20:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:20:20,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:20:20,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 22:20:20,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 22:20:20,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:20,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:20:20,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:20:20,342 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:20:20,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:20:20,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:20:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:20:20,553 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 22:20:20,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:20:20,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:20:20 BoogieIcfgContainer [2025-03-03 22:20:20,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:20:20,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:20:20,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:20:20,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:20:20,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:20:18" (3/4) ... [2025-03-03 22:20:20,625 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:20:20,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:20:20,626 INFO L158 Benchmark]: Toolchain (without parser) took 2367.31ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 77.4MB in the end (delta: 28.5MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-03-03 22:20:20,626 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:20:20,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.29ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:20:20,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:20:20,627 INFO L158 Benchmark]: Boogie Preprocessor took 36.38ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:20:20,627 INFO L158 Benchmark]: IcfgBuilder took 362.92ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 60.0MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:20:20,627 INFO L158 Benchmark]: TraceAbstraction took 1683.70ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 77.4MB in the end (delta: -18.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:20:20,628 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 77.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:20:20,629 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.29ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.38ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 362.92ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 60.0MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1683.70ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 77.4MB in the end (delta: -18.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 77.4MB in the end (delta: 37.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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] var_1_5 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L96] var_1_8 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L102] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L108] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L110] var_1_16 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L113] var_1_18 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L114] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L116] var_1_20 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L117] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L119] var_1_21 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L120] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L135] RET updateVariables() [L136] CALL step() [L46] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L47] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L49] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L50] unsigned short int stepLocal_3 = var_1_12; [L51] unsigned short int stepLocal_2 = var_1_12; [L52] unsigned short int stepLocal_1 = var_1_12; [L53] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L55] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L69] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L74] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L75] COND TRUE var_1_13 <= var_1_11 [L76] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L80] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L81] COND TRUE var_1_19 <= var_1_1 [L82] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L127-L128] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 104 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2162/2208 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:20:20,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:20:22,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:20:22,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:20:22,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:20:22,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:20:22,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:20:22,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:20:22,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:20:22,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:20:22,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:20:22,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:20:22,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:20:22,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:20:22,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:20:22,535 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:20:22,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:20:22,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:20:22,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:20:22,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:20:22,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:20:22,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:20:22,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:20:22,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:20:22,539 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2025-03-03 22:20:22,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:20:22,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:20:22,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:20:22,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:20:22,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:20:22,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:23,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87e5db79/0cb57993b319443db7252d3f9f0e4eab/FLAG61756d1ec [2025-03-03 22:20:24,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:20:24,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:24,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87e5db79/0cb57993b319443db7252d3f9f0e4eab/FLAG61756d1ec [2025-03-03 22:20:24,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87e5db79/0cb57993b319443db7252d3f9f0e4eab [2025-03-03 22:20:24,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:20:24,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:20:24,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:20:24,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:20:24,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:20:24,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bd088c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24, skipping insertion in model container [2025-03-03 22:20:24,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:20:24,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-03-03 22:20:24,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:20:24,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:20:24,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-03-03 22:20:24,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:20:24,377 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:20:24,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24 WrapperNode [2025-03-03 22:20:24,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:20:24,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:20:24,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:20:24,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:20:24,383 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:20:24" (1/1) ... [2025-03-03 22:20:24,389 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:20:24" (1/1) ... [2025-03-03 22:20:24,404 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-03 22:20:24,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:20:24,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:20:24,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:20:24,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:20:24,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,428 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:20:24,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,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:20:24" (1/1) ... [2025-03-03 22:20:24,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:20:24,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:20:24,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:20:24,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:20:24,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (1/1) ... [2025-03-03 22:20:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:20:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:20:24,476 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:20:24,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:20:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:20:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:20:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:20:24,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:20:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:20:24,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:20:24,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:20:24,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:20:25,267 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:20:25,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:20:25,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:20:25,278 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:20:25,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:20:25 BoogieIcfgContainer [2025-03-03 22:20:25,278 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:20:25,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:20:25,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:20:25,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:20:25,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:20:24" (1/3) ... [2025-03-03 22:20:25,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fb58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:20:25, skipping insertion in model container [2025-03-03 22:20:25,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:20:24" (2/3) ... [2025-03-03 22:20:25,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fb58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:20:25, skipping insertion in model container [2025-03-03 22:20:25,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:20:25" (3/3) ... [2025-03-03 22:20:25,298 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-98.i [2025-03-03 22:20:25,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:20:25,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-98.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:20:25,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:20:25,355 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;@335b38f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:20:25,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:20:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:20:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:20:25,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:25,365 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash -609157204, now seen corresponding path program 1 times [2025-03-03 22:20:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:20:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036543947] [2025-03-03 22:20:25,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:25,375 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:20:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:20:25,377 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:20:25,378 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:20:25,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:20:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:20:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:20:25,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:20:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 22:20:25,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:20:25,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:20:25,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036543947] [2025-03-03 22:20:25,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036543947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:20:25,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:20:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:20:25,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134282449] [2025-03-03 22:20:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:20:25,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:20:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:20:25,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:20:25,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:20:25,674 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:20:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:20:25,696 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2025-03-03 22:20:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:20:25,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2025-03-03 22:20:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:20:25,702 INFO L225 Difference]: With dead ends: 126 [2025-03-03 22:20:25,702 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 22:20:25,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:20:25,708 INFO L435 NwaCegarLoop]: 95 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, 95 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:20:25,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:20:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 22:20:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 22:20:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:20:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 22:20:25,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 150 [2025-03-03 22:20:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:20:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 22:20:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:20:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 22:20:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:20:25,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:25,751 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,762 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:20:25,951 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:20:25,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:25,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash 360143024, now seen corresponding path program 1 times [2025-03-03 22:20:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:20:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154791900] [2025-03-03 22:20:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:25,954 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:20:25,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:20:25,956 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:20:25,958 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:20:26,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:20:26,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:20:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:26,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:20:26,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:20:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:20:26,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:20:26,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:20:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154791900] [2025-03-03 22:20:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154791900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:20:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:20:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:20:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61095444] [2025-03-03 22:20:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:20:26,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:20:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:20:26,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:20:26,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:20:26,564 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:20:27,018 INFO L93 Difference]: Finished difference Result 181 states and 275 transitions. [2025-03-03 22:20:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:20:27,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 22:20:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:20:27,036 INFO L225 Difference]: With dead ends: 181 [2025-03-03 22:20:27,036 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 22:20:27,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:20:27,037 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:20:27,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:20:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 22:20:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-03 22:20:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:20:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2025-03-03 22:20:27,051 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 150 [2025-03-03 22:20:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:20:27,052 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2025-03-03 22:20:27,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2025-03-03 22:20:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:20:27,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:27,053 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,063 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:20:27,253 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:20:27,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1633321840, now seen corresponding path program 1 times [2025-03-03 22:20:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:20:27,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115101238] [2025-03-03 22:20:27,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:27,255 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:20:27,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:20:27,256 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:20:27,257 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:20:27,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:20:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:20:27,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:27,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:27,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:20:27,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:20:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:20:27,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:20:27,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:20:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115101238] [2025-03-03 22:20:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115101238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:20:27,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:20:27,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:20:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042309337] [2025-03-03 22:20:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:20:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:20:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:20:27,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:20:27,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:20:27,515 INFO L87 Difference]: Start difference. First operand 119 states and 181 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:20:27,955 INFO L93 Difference]: Finished difference Result 280 states and 428 transitions. [2025-03-03 22:20:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:20:27,971 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 22:20:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:20:27,973 INFO L225 Difference]: With dead ends: 280 [2025-03-03 22:20:27,973 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 22:20:27,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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:20:27,975 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 89 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:20:27,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 223 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:20:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 22:20:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2025-03-03 22:20:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 68 states have internal predecessors, (83), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:20:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-03 22:20:28,000 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 150 [2025-03-03 22:20:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:20:28,000 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-03 22:20:28,000 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-03 22:20:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:20:28,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:28,002 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,011 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 (4)] Ended with exit code 0 [2025-03-03 22:20:28,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:20:28,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:28,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1829835345, now seen corresponding path program 1 times [2025-03-03 22:20:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:20:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705780613] [2025-03-03 22:20:28,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:28,204 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:20:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:20:28,206 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20:28,206 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 (5)] Waiting until timeout for monitored process [2025-03-03 22:20:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:20:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:20:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:28,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:28,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:20:28,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:20:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:20:28,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:20:28,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:20:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705780613] [2025-03-03 22:20:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705780613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:20:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:20:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:20:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676677143] [2025-03-03 22:20:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:20:28,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:20:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:20:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:20:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:20:28,483 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:20:29,674 INFO L93 Difference]: Finished difference Result 342 states and 517 transitions. [2025-03-03 22:20:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:20:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 22:20:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:20:29,679 INFO L225 Difference]: With dead ends: 342 [2025-03-03 22:20:29,679 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 22:20:29,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:20:29,680 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 158 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:20:29,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 372 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 22:20:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 22:20:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-03-03 22:20:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 117 states have (on average 1.188034188034188) internal successors, (139), 117 states have internal predecessors, (139), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 22:20:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 331 transitions. [2025-03-03 22:20:29,730 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 331 transitions. Word has length 150 [2025-03-03 22:20:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:20:29,730 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 331 transitions. [2025-03-03 22:20:29,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 22:20:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 331 transitions. [2025-03-03 22:20:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:20:29,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:20:29,735 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,744 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 (5)] Ended with exit code 0 [2025-03-03 22:20:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:20:29,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:20:29,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:20:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1828911824, now seen corresponding path program 1 times [2025-03-03 22:20:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:20:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331019890] [2025-03-03 22:20:29,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:20:29,936 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:20:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:20:29,938 INFO L229 MonitoredProcess]: Starting monitored process 6 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:20:29,939 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 (6)] Waiting until timeout for monitored process [2025-03-03 22:20:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:20:30,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:20:30,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:20:30,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:20:30,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:20:30,121 INFO L279 TraceCheckSpWp]: Computing forward predicates...