./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:21:27,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:21:27,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:21:27,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:21:27,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:21:27,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:21:27,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:21:27,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:21:27,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:21:27,351 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:21:27,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:21:27,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:21:27,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:21:27,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:21:27,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:21:27,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:27,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:21:27,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:21:27,353 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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2025-03-16 23:21:27,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:21:27,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:21:27,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:21:27,586 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:21:27,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:21:27,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:28,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a543cb72/8537326f5b6844119c15e52a060572cb/FLAG1f1e53b71 [2025-03-16 23:21:28,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:21:28,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:28,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a543cb72/8537326f5b6844119c15e52a060572cb/FLAG1f1e53b71 [2025-03-16 23:21:29,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a543cb72/8537326f5b6844119c15e52a060572cb [2025-03-16 23:21:29,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:21:29,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:21:29,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:29,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:21:29,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:21:29,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dd3d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29, skipping insertion in model container [2025-03-16 23:21:29,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:21:29,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_codestructure_steplocals_file-53.i[917,930] [2025-03-16 23:21:29,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:29,403 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:21:29,410 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_codestructure_steplocals_file-53.i[917,930] [2025-03-16 23:21:29,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:29,441 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:21:29,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29 WrapperNode [2025-03-16 23:21:29,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:29,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:29,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:21:29,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:21:29,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,475 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-16 23:21:29,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:29,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:21:29,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:21:29,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:21:29,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:21:29,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:21:29,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:21:29,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:21:29,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:21:29,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (1/1) ... [2025-03-16 23:21:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:29,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:21:29,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:21:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:21:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:21:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:21:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:21:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:21:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:21:29,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:21:29,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:21:29,865 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-16 23:21:29,897 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-16 23:21:29,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:21:29,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:21:29,913 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-16 23:21:29,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:29 BoogieIcfgContainer [2025-03-16 23:21:29,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:21:29,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:21:29,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:21:29,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:21:29,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:21:29" (1/3) ... [2025-03-16 23:21:29,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ce1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:29, skipping insertion in model container [2025-03-16 23:21:29,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:29" (2/3) ... [2025-03-16 23:21:29,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ce1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:29, skipping insertion in model container [2025-03-16 23:21:29,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:29" (3/3) ... [2025-03-16 23:21:29,925 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:29,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:21:29,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-53.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:21:29,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:21:29,978 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;@30e22600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:21:29,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:21:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:21:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:21:29,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:29,992 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:29,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2136363558, now seen corresponding path program 1 times [2025-03-16 23:21:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763233650] [2025-03-16 23:21:30,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:30,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:21:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:21:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:30,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:21:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763233650] [2025-03-16 23:21:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763233650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:21:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652079162] [2025-03-16 23:21:30,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:30,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:21:30,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:30,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:21:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:21:30,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:21:30,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:21:30,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:30,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:30,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:21:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:21:30,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652079162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:30,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:21:30,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:21:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074479164] [2025-03-16 23:21:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:30,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:21:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:30,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:21:30,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:30,492 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:21:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:30,516 INFO L93 Difference]: Finished difference Result 173 states and 299 transitions. [2025-03-16 23:21:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:21:30,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2025-03-16 23:21:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:30,522 INFO L225 Difference]: With dead ends: 173 [2025-03-16 23:21:30,522 INFO L226 Difference]: Without dead ends: 86 [2025-03-16 23:21:30,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:30,528 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:30,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-16 23:21:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-16 23:21:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:21:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2025-03-16 23:21:30,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 179 [2025-03-16 23:21:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:30,563 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2025-03-16 23:21:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:21:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2025-03-16 23:21:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:21:30,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:30,567 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:30,574 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-16 23:21:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:21:30,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -998489995, now seen corresponding path program 1 times [2025-03-16 23:21:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015013028] [2025-03-16 23:21:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:30,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:21:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:21:30,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:30,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:21:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015013028] [2025-03-16 23:21:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015013028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:21:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323753055] [2025-03-16 23:21:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:21:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:30,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:21:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:30,997 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:21:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:31,065 INFO L93 Difference]: Finished difference Result 247 states and 379 transitions. [2025-03-16 23:21:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:21:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2025-03-16 23:21:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:31,069 INFO L225 Difference]: With dead ends: 247 [2025-03-16 23:21:31,069 INFO L226 Difference]: Without dead ends: 162 [2025-03-16 23:21:31,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:31,070 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 121 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:31,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 250 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-16 23:21:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-03-16 23:21:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:21:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2025-03-16 23:21:31,098 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 179 [2025-03-16 23:21:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:31,098 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2025-03-16 23:21:31,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:21:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2025-03-16 23:21:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 23:21:31,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:31,101 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:21:31,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1752502222, now seen corresponding path program 1 times [2025-03-16 23:21:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944936650] [2025-03-16 23:21:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:31,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:21:31,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:21:31,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:21:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766473651] [2025-03-16 23:21:31,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:31,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:21:31,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:31,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:21:31,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:21:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:21:31,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:21:31,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:31,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:21:31,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:21:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:21:31,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:21:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:21:31,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:21:31,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:21:31,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:21:31,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:21:31,969 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,SelfDestructingSolverStorable2 [2025-03-16 23:21:31,971 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:21:32,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:21:32,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:21:32 BoogieIcfgContainer [2025-03-16 23:21:32,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:21:32,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:21:32,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:21:32,058 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:21:32,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:29" (3/4) ... [2025-03-16 23:21:32,060 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:21:32,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:21:32,061 INFO L158 Benchmark]: Toolchain (without parser) took 2807.56ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 100.4MB in the end (delta: 22.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2025-03-16 23:21:32,061 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:21:32,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.80ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:21:32,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:21:32,062 INFO L158 Benchmark]: Boogie Preprocessor took 31.17ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:21:32,062 INFO L158 Benchmark]: IcfgBuilder took 406.45ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 78.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:21:32,062 INFO L158 Benchmark]: TraceAbstraction took 2141.37ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 100.5MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:21:32,062 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:21:32,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.80ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.17ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 406.45ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 78.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2141.37ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 100.5MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryArithmeticFLOAToperation at line 65, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed char var_1_2 = -64; [L24] signed char var_1_3 = -1; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 10; [L31] float var_1_10 = 99.5; [L32] float var_1_11 = 5.6; [L33] float var_1_12 = 255.5; [L34] float var_1_13 = 31.25; [L35] signed short int var_1_14 = 32; [L36] unsigned long int var_1_15 = 16; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 50; [L40] unsigned char var_1_19 = 50; [L41] signed char var_1_20 = 1; [L42] signed char var_1_21 = -10; [L43] float var_1_22 = 0.5; [L44] signed char var_1_23 = 100; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L94] var_1_3 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L97] var_1_4 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L100] var_1_5 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L101] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L103] var_1_6 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L105] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L106] var_1_7 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_8=0, var_1_9=10] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_8=0, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L108] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=0, var_1_9=10] [L109] var_1_8 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L110] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L114] var_1_12 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L116] var_1_13 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L118] var_1_15 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L119] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L120] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L120] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L121] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L122] var_1_17 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L125] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L125] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L128] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L129] var_1_19 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L131] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L131] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L132] var_1_21 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_1 = var_1_2 * var_1_3; [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L50] COND TRUE stepLocal_1 == var_1_4 VAL [isInitial=1, stepLocal_0=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L51] COND TRUE (var_1_4 > (var_1_5 - var_1_6)) && stepLocal_0 [L52] var_1_1 = var_1_8 VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L55] signed long int stepLocal_3 = (((var_1_6) < (0)) ? (var_1_6) : (0)); [L56] unsigned char stepLocal_2 = var_1_3 != var_1_4; VAL [isInitial=1, stepLocal_2=1, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L57] COND TRUE (var_1_1 || (var_1_6 <= var_1_2)) || stepLocal_2 VAL [isInitial=1, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=10] [L58] COND TRUE stepLocal_3 <= (-5 + var_1_5) [L59] var_1_9 = var_1_6 VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L62] unsigned char stepLocal_5 = var_1_11 < var_1_12; [L63] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, stepLocal_4=1, stepLocal_5=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L64] COND TRUE (! var_1_1) || stepLocal_4 [L65] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L73] COND TRUE \read(var_1_1) [L74] var_1_14 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L82] EXPR 256u << var_1_2 VAL [isInitial=1, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L82] unsigned long int stepLocal_6 = 256u << var_1_2; [L83] COND FALSE !((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= stepLocal_6) VAL [isInitial=1, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L86] var_1_20 = var_1_21 [L87] var_1_22 = var_1_12 [L88] var_1_23 = var_1_21 [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L139] EXPR ((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L139-L140] return (((((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=257, var_1_6=514, var_1_7=1, var_1_8=1, var_1_9=514] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 165 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 272 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 4816/4872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:21:32,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:21:33,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:21:33,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:21:33,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:21:33,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:21:33,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:21:33,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:21:33,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:21:33,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:21:33,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:21:33,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:21:33,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:21:33,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:21:33,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:33,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:21:33,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:21:33,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:21:33,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:21:33,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:21:33,941 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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2025-03-16 23:21:34,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:21:34,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:21:34,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:21:34,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:21:34,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:21:34,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:35,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c6d3e5/ff47d037d57d48f8a9686b97fe192eed/FLAG5a6868b09 [2025-03-16 23:21:35,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:21:35,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:35,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c6d3e5/ff47d037d57d48f8a9686b97fe192eed/FLAG5a6868b09 [2025-03-16 23:21:35,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c6d3e5/ff47d037d57d48f8a9686b97fe192eed [2025-03-16 23:21:35,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:21:35,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:21:35,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:35,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:21:35,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:21:35,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:35" (1/1) ... [2025-03-16 23:21:35,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d22775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:35, skipping insertion in model container [2025-03-16 23:21:35,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:35" (1/1) ... [2025-03-16 23:21:35,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:21:36,019 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_codestructure_steplocals_file-53.i[917,930] [2025-03-16 23:21:36,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:36,061 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:21:36,068 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_codestructure_steplocals_file-53.i[917,930] [2025-03-16 23:21:36,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:36,103 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:21:36,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36 WrapperNode [2025-03-16 23:21:36,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:36,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:36,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:21:36,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:21:36,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,142 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-16 23:21:36,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:36,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:21:36,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:21:36,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:21:36,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,175 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:21:36,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:21:36,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:21:36,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:21:36,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:21:36,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (1/1) ... [2025-03-16 23:21:36,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:36,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:21:36,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:21:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:21:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:21:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:21:36,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:21:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:21:36,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:21:36,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:21:36,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:21:36,765 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:21:36,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:21:36,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:21:36,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:21:36,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:36 BoogieIcfgContainer [2025-03-16 23:21:36,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:21:36,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:21:36,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:21:36,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:21:36,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:21:35" (1/3) ... [2025-03-16 23:21:36,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a59086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:36, skipping insertion in model container [2025-03-16 23:21:36,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:36" (2/3) ... [2025-03-16 23:21:36,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a59086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:36, skipping insertion in model container [2025-03-16 23:21:36,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:36" (3/3) ... [2025-03-16 23:21:36,809 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2025-03-16 23:21:36,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:21:36,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-53.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:21:36,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:21:36,860 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;@2920b7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:21:36,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:21:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:21:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 23:21:36,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:36,870 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:36,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:36,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 5729984, now seen corresponding path program 1 times [2025-03-16 23:21:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626573549] [2025-03-16 23:21:36,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:36,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:21:36,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:36,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:21:36,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 23:21:36,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 23:21:37,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 23:21:37,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:37,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:21:37,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:21:37,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:37,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:21:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626573549] [2025-03-16 23:21:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626573549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:37,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:21:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084240870] [2025-03-16 23:21:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:21:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:21:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:21:37,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:37,177 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:21:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:37,194 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2025-03-16 23:21:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:21:37,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 173 [2025-03-16 23:21:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:37,202 INFO L225 Difference]: With dead ends: 135 [2025-03-16 23:21:37,203 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:21:37,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:37,207 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:37,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:21:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 23:21:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:21:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2025-03-16 23:21:37,244 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 173 [2025-03-16 23:21:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:37,244 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2025-03-16 23:21:37,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:21:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2025-03-16 23:21:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 23:21:37,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:37,249 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:37,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:21:37,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:21:37,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:37,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1875300763, now seen corresponding path program 1 times [2025-03-16 23:21:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:37,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308686115] [2025-03-16 23:21:37,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:37,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:21:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:37,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:21:37,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 23:21:37,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 23:21:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 23:21:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:37,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:37,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:21:37,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:21:38,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:38,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:21:38,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308686115] [2025-03-16 23:21:38,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308686115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:38,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:38,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:21:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569894845] [2025-03-16 23:21:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:38,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:21:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:21:38,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:21:38,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:38,013 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:21:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:38,236 INFO L93 Difference]: Finished difference Result 197 states and 306 transitions. [2025-03-16 23:21:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:21:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 173 [2025-03-16 23:21:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:38,247 INFO L225 Difference]: With dead ends: 197 [2025-03-16 23:21:38,248 INFO L226 Difference]: Without dead ends: 131 [2025-03-16 23:21:38,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-16 23:21:38,249 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:38,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:21:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-16 23:21:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-16 23:21:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:21:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 200 transitions. [2025-03-16 23:21:38,276 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 200 transitions. Word has length 173 [2025-03-16 23:21:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:38,276 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 200 transitions. [2025-03-16 23:21:38,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:21:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2025-03-16 23:21:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 23:21:38,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:38,278 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:21:38,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 23:21:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:21:38,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 726429643, now seen corresponding path program 1 times [2025-03-16 23:21:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122193290] [2025-03-16 23:21:38,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:38,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:21:38,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:38,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:21:38,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:21:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 23:21:38,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 23:21:38,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:38,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:38,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 23:21:38,674 INFO L279 TraceCheckSpWp]: Computing forward predicates...