./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 879adeb8becc66b2b34de3e70e20caf3f4cebcfa7a9bac7334de1d0ce7d39f0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:51:33,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:51:33,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:51:33,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:51:33,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:51:33,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:51:33,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:51:33,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:51:33,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:51:33,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:51:33,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:51:33,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:51:33,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:51:33,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:51:33,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:51:33,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:33,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:51:33,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:33,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:51:33,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:51:33,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 879adeb8becc66b2b34de3e70e20caf3f4cebcfa7a9bac7334de1d0ce7d39f0f [2025-01-09 10:51:33,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:51:33,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:51:33,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:51:33,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:51:33,574 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:51:33,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:34,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9ab9e08/edb364d8ad804b238f0aa4b7302f37d5/FLAG34526ef8b [2025-01-09 10:51:34,933 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:51:34,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:34,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9ab9e08/edb364d8ad804b238f0aa4b7302f37d5/FLAG34526ef8b [2025-01-09 10:51:35,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9ab9e08/edb364d8ad804b238f0aa4b7302f37d5 [2025-01-09 10:51:35,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:51:35,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:51:35,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:51:35,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:51:35,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:51:35,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fe0a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35, skipping insertion in model container [2025-01-09 10:51:35,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:51:35,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i[919,932] [2025-01-09 10:51:35,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:51:35,446 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:51:35,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i[919,932] [2025-01-09 10:51:35,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:51:35,486 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:51:35,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35 WrapperNode [2025-01-09 10:51:35,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:51:35,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:51:35,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:51:35,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:51:35,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,526 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-01-09 10:51:35,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:51:35,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:51:35,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:51:35,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:51:35,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:51:35,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:51:35,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:51:35,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:51:35,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:51:35,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (1/1) ... [2025-01-09 10:51:35,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:35,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:51:35,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:51:35,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:51:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:51:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:51:35,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:51:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:51:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:51:35,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:51:35,678 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:51:35,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:51:35,961 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:51:35,961 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:51:35,967 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:51:35,967 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:51:35,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:51:35 BoogieIcfgContainer [2025-01-09 10:51:35,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:51:35,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:51:35,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:51:35,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:51:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:51:35" (1/3) ... [2025-01-09 10:51:35,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749ba924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:51:35, skipping insertion in model container [2025-01-09 10:51:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:35" (2/3) ... [2025-01-09 10:51:35,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749ba924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:51:35, skipping insertion in model container [2025-01-09 10:51:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:51:35" (3/3) ... [2025-01-09 10:51:35,973 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:35,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:51:35,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:51:36,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:51:36,034 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;@7f6077a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:51:36,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:51:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:51:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:51:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:36,044 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:36,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1400258794, now seen corresponding path program 1 times [2025-01-09 10:51:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287915523] [2025-01-09 10:51:36,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:36,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:36,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 10:51:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:36,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287915523] [2025-01-09 10:51:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287915523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:51:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581908231] [2025-01-09 10:51:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:51:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:51:36,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:51:36,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:51:36,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:36,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:51:36,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:51:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 10:51:36,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:51:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581908231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:51:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:51:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097590573] [2025-01-09 10:51:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:36,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:51:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:36,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:51:36,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:51:36,431 INFO L87 Difference]: Start difference. First operand has 82 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:51:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:36,446 INFO L93 Difference]: Finished difference Result 156 states and 268 transitions. [2025-01-09 10:51:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:51:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-01-09 10:51:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:36,451 INFO L225 Difference]: With dead ends: 156 [2025-01-09 10:51:36,451 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 10:51:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:51:36,454 INFO L435 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:51:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 10:51:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 10:51:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:51:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-01-09 10:51:36,484 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 151 [2025-01-09 10:51:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-01-09 10:51:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:51:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-01-09 10:51:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:51:36,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:36,490 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:36,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:51:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:51:36,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -349681758, now seen corresponding path program 1 times [2025-01-09 10:51:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333677650] [2025-01-09 10:51:36,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:36,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:36,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:36,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:36,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:51:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333677650] [2025-01-09 10:51:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333677650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:36,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:51:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777248428] [2025-01-09 10:51:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:36,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:51:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:36,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:51:36,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:51:36,872 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:51:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:36,913 INFO L93 Difference]: Finished difference Result 222 states and 340 transitions. [2025-01-09 10:51:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:51:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 10:51:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:36,915 INFO L225 Difference]: With dead ends: 222 [2025-01-09 10:51:36,915 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 10:51:36,916 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-01-09 10:51:36,916 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 101 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:36,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 292 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:51:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 10:51:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2025-01-09 10:51:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:51:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2025-01-09 10:51:36,926 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 151 [2025-01-09 10:51:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2025-01-09 10:51:36,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:51:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2025-01-09 10:51:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:51:36,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:36,929 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:51:36,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 661435492, now seen corresponding path program 1 times [2025-01-09 10:51:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438019177] [2025-01-09 10:51:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:36,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:37,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:37,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:37,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:51:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210054916] [2025-01-09 10:51:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:51:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:51:37,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:51:37,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:51:37,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:37,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 10:51:37,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:51:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 10:51:37,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:51:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 10:51:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438019177] [2025-01-09 10:51:38,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 10:51:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210054916] [2025-01-09 10:51:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210054916] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:51:38,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:51:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-01-09 10:51:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571242344] [2025-01-09 10:51:38,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:51:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 10:51:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:38,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 10:51:38,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:51:38,537 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 10:51:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:39,403 INFO L93 Difference]: Finished difference Result 284 states and 407 transitions. [2025-01-09 10:51:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 10:51:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 151 [2025-01-09 10:51:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:39,405 INFO L225 Difference]: With dead ends: 284 [2025-01-09 10:51:39,405 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 10:51:39,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 10:51:39,407 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 565 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:39,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 412 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:51:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 10:51:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 127. [2025-01-09 10:51:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 92 states have internal predecessors, (120), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:51:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2025-01-09 10:51:39,424 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 151 [2025-01-09 10:51:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2025-01-09 10:51:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 10:51:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2025-01-09 10:51:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:51:39,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:39,429 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:39,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 10:51:39,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:51:39,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:39,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -634098011, now seen corresponding path program 1 times [2025-01-09 10:51:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729301168] [2025-01-09 10:51:39,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:39,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:51:39,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:51:39,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:39,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:51:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437571141] [2025-01-09 10:51:39,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:39,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:51:39,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:51:39,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:51:39,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:51:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:51:39,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:51:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:51:39,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:51:39,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:51:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:51:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:51:39,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:51:39,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:51:39,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:51:39,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:51:40,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:51:40,181 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 10:51:40,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:51:40,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:51:40 BoogieIcfgContainer [2025-01-09 10:51:40,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:51:40,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:51:40,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:51:40,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:51:40,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:51:35" (3/4) ... [2025-01-09 10:51:40,284 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:51:40,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:51:40,285 INFO L158 Benchmark]: Toolchain (without parser) took 5040.92ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 111.6MB in the end (delta: 21.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-01-09 10:51:40,287 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:51:40,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.70ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 118.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:51:40,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.30ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 114.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:51:40,287 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 108.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:51:40,287 INFO L158 Benchmark]: RCFGBuilder took 404.70ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 84.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 10:51:40,288 INFO L158 Benchmark]: TraceAbstraction took 4311.99ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 111.7MB in the end (delta: -28.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2025-01-09 10:51:40,288 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 111.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:51:40,290 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.17ms. Allocated memory is still 209.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.70ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 118.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.30ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 114.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 108.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 404.70ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 84.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4311.99ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 111.7MB in the end (delta: -28.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 111.6MB in the end (delta: 33.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 163, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] unsigned char var_1_27 = 50; [L40] unsigned char var_1_28 = 8; [L41] signed short int var_1_29 = 10; [L42] double var_1_33 = 7.125; [L43] float var_1_34 = 0.75; [L44] float var_1_35 = 25.5; [L45] float var_1_36 = 9.038; [L46] double var_1_38 = 15.5; [L47] float var_1_39 = 128.5; [L48] float var_1_41 = 15.25; [L49] float var_1_42 = 64.5; [L50] float var_1_43 = 256.3; [L51] unsigned long int var_1_44 = 32; [L52] double var_1_45 = 63.25; [L53] unsigned char last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L183] isInitial = 1 [L184] FCALL initially() [L186] CALL updateLastVariables() [L176] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L137] var_1_4 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L138] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L141] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] var_1_11 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] var_1_12 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] var_1_14 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L150] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] var_1_16 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L152] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] var_1_18 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L155] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L157] var_1_28 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L158] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L160] var_1_34 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L161] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L162] var_1_35 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L163] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L164] var_1_36 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L165] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L166] var_1_38 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L167] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L168] var_1_41 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L169] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L170] var_1_42 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L171] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L172] var_1_43 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L173] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L187] RET updateVariables() [L188] CALL step() [L57] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L65] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L70] COND TRUE (- var_1_13) > 31.9f [L71] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L75] COND TRUE \read(var_1_1) [L76] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L78] var_1_22 = 1 [L79] var_1_23 = var_1_22 [L80] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L81] COND TRUE var_1_15 > stepLocal_0 [L82] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L84] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=1, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L85] COND TRUE var_1_1 || stepLocal_2 [L86] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L90] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L91] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L94] COND FALSE !(! (var_1_17 <= var_1_17)) [L97] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L100] COND TRUE 32.2f > (25.5f - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L101] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L103] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L104] COND FALSE !(var_1_13 <= ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L111] COND FALSE !(var_1_13 > (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - var_1_36)) [L120] var_1_33 = 10000.5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L122] COND TRUE \read(var_1_1) [L123] var_1_39 = var_1_38 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L129] COND TRUE ((var_1_38 + var_1_13) * ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42)))) >= var_1_35 [L130] var_1_44 = ((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=2, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L132] COND TRUE \read(var_1_1) [L133] var_1_45 = (((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) + var_1_42) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=16386, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_38=2, var_1_39=2, var_1_44=2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 383 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=3, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 120 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 2167 SizeOfPredicates, 6 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4488/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:51:40,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 879adeb8becc66b2b34de3e70e20caf3f4cebcfa7a9bac7334de1d0ce7d39f0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:51:42,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:51:42,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:51:42,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:51:42,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:51:42,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:51:42,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:51:42,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:51:42,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:51:42,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:51:42,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:51:42,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:51:42,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:51:42,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:51:42,296 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:51:42,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:51:42,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:51:42,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:51:42,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:51:42,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:51:42,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:51:42,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:51:42,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:42,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:42,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:51:42,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:51:42,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:51:42,300 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 879adeb8becc66b2b34de3e70e20caf3f4cebcfa7a9bac7334de1d0ce7d39f0f [2025-01-09 10:51:42,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:51:42,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:51:42,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:51:42,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:51:42,562 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:51:42,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:43,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9251c697/dba74bf9b29b46b7ba8488b6d6577e44/FLAG78f26610e [2025-01-09 10:51:44,015 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:51:44,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:44,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9251c697/dba74bf9b29b46b7ba8488b6d6577e44/FLAG78f26610e [2025-01-09 10:51:44,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9251c697/dba74bf9b29b46b7ba8488b6d6577e44 [2025-01-09 10:51:44,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:51:44,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:51:44,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:51:44,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:51:44,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:51:44,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbe6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44, skipping insertion in model container [2025-01-09 10:51:44,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:51:44,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i[919,932] [2025-01-09 10:51:44,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:51:44,248 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:51:44,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i[919,932] [2025-01-09 10:51:44,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:51:44,306 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:51:44,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44 WrapperNode [2025-01-09 10:51:44,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:51:44,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:51:44,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:51:44,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:51:44,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,338 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-01-09 10:51:44,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:51:44,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:51:44,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:51:44,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:51:44,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:51:44,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:51:44,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:51:44,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:51:44,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:51:44,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (1/1) ... [2025-01-09 10:51:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:51:44,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:51:44,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:51:44,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:51:44,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:51:44,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:51:44,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:51:44,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:51:44,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:51:44,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:51:44,476 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:51:44,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:51:56,815 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:51:56,815 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:51:56,824 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:51:56,824 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:51:56,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:51:56 BoogieIcfgContainer [2025-01-09 10:51:56,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:51:56,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:51:56,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:51:56,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:51:56,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:51:44" (1/3) ... [2025-01-09 10:51:56,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb5970b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:51:56, skipping insertion in model container [2025-01-09 10:51:56,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:51:44" (2/3) ... [2025-01-09 10:51:56,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb5970b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:51:56, skipping insertion in model container [2025-01-09 10:51:56,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:51:56" (3/3) ... [2025-01-09 10:51:56,833 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i [2025-01-09 10:51:56,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:51:56,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-41.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:51:56,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:51:56,877 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;@c8150f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:51:56,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:51:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:51:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:51:56,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:56,887 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:56,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 441861966, now seen corresponding path program 1 times [2025-01-09 10:51:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:51:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916924782] [2025-01-09 10:51:56,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:56,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:51:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:51:56,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:51:56,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 10:51:56,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:57,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:51:57,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:51:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 10:51:57,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:51:57,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:51:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916924782] [2025-01-09 10:51:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916924782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:51:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646153576] [2025-01-09 10:51:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:57,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:51:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:51:57,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:51:57,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:51:57,464 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:51:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:57,483 INFO L93 Difference]: Finished difference Result 152 states and 261 transitions. [2025-01-09 10:51:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:51:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-01-09 10:51:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:57,489 INFO L225 Difference]: With dead ends: 152 [2025-01-09 10:51:57,489 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 10:51:57,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:51:57,492 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:57,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:51:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 10:51:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 10:51:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 10:51:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-01-09 10:51:57,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 151 [2025-01-09 10:51:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-01-09 10:51:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 10:51:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-01-09 10:51:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:51:57,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:57,528 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:57,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 10:51:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:51:57,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1492439002, now seen corresponding path program 1 times [2025-01-09 10:51:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:51:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257235060] [2025-01-09 10:51:57,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:57,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:51:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:51:57,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:51:57,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 10:51:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:51:58,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:51:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:58,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:51:58,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:52:02,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:52:02,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:52:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257235060] [2025-01-09 10:52:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257235060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:02,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:02,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:52:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997049122] [2025-01-09 10:52:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:02,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:52:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:52:02,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:52:02,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:02,242 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:52:08,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:12,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:17,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:21,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:23,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:23,869 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2025-01-09 10:52:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:52:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 10:52:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:23,872 INFO L225 Difference]: With dead ends: 221 [2025-01-09 10:52:23,872 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 10:52:23,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 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-01-09 10:52:23,873 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 39 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:23,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 199 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 21.6s Time] [2025-01-09 10:52:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 10:52:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2025-01-09 10:52:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:52:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions. [2025-01-09 10:52:23,889 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 151 [2025-01-09 10:52:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:23,889 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions. [2025-01-09 10:52:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:52:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2025-01-09 10:52:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:52:23,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:23,890 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:23,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:52:24,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:24,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:24,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash -341648440, now seen corresponding path program 1 times [2025-01-09 10:52:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:52:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736080370] [2025-01-09 10:52:24,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:24,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:24,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:52:24,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:52:24,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 10:52:24,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:52:24,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:52:24,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:24,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:24,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:52:24,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 177 proven. 57 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-01-09 10:52:26,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:52:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 10:52:27,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:52:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736080370] [2025-01-09 10:52:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736080370] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:52:27,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:52:27,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 10:52:27,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205611901] [2025-01-09 10:52:27,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:52:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:52:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:52:27,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:52:27,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:52:27,269 INFO L87 Difference]: Start difference. First operand 145 states and 220 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 10:52:30,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:32,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:32,138 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2025-01-09 10:52:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:52:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 152 [2025-01-09 10:52:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:32,161 INFO L225 Difference]: With dead ends: 230 [2025-01-09 10:52:32,161 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 10:52:32,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:52:32,162 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:32,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 212 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 10:52:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 10:52:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-01-09 10:52:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 104 states have internal predecessors, (137), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:52:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 225 transitions. [2025-01-09 10:52:32,174 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 225 transitions. Word has length 152 [2025-01-09 10:52:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:32,174 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 225 transitions. [2025-01-09 10:52:32,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 10:52:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2025-01-09 10:52:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:52:32,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:32,176 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:32,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 10:52:32,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:32,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:32,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 81053386, now seen corresponding path program 1 times [2025-01-09 10:52:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:52:32,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102354508] [2025-01-09 10:52:32,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:32,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:52:32,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:52:32,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 10:52:32,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:52:32,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:52:32,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:32,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:32,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 10:52:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 117 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-01-09 10:52:36,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:52:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-01-09 10:52:39,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:52:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102354508] [2025-01-09 10:52:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102354508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:52:39,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:52:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-01-09 10:52:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384545160] [2025-01-09 10:52:39,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:52:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:52:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:52:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:52:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:52:39,197 INFO L87 Difference]: Start difference. First operand 153 states and 225 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 3 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:52:44,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:52:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:52:48,715 INFO L93 Difference]: Finished difference Result 471 states and 666 transitions. [2025-01-09 10:52:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 10:52:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 3 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) Word has length 152 [2025-01-09 10:52:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:52:48,728 INFO L225 Difference]: With dead ends: 471 [2025-01-09 10:52:48,728 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 10:52:48,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=452, Invalid=1188, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 10:52:48,730 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 358 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:52:48,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 549 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-01-09 10:52:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 10:52:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 167. [2025-01-09 10:52:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:52:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2025-01-09 10:52:48,758 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 152 [2025-01-09 10:52:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:52:48,759 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2025-01-09 10:52:48,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 3 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:52:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2025-01-09 10:52:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:52:48,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:52:48,763 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:52:48,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:52:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:48,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:52:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:52:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1092170636, now seen corresponding path program 1 times [2025-01-09 10:52:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:52:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365763411] [2025-01-09 10:52:48,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:52:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:52:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:52:48,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:52:48,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 10:52:49,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:52:49,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:52:49,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:52:49,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:52:49,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:52:49,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:52:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 10:52:49,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:52:49,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:52:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365763411] [2025-01-09 10:52:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365763411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:52:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:52:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:52:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241968094] [2025-01-09 10:52:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:52:49,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:52:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:52:49,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:52:49,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:52:49,682 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:52:56,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:00,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:04,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:09,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:11,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 10:53:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:14,164 INFO L93 Difference]: Finished difference Result 335 states and 455 transitions. [2025-01-09 10:53:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-01-09 10:53:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:14,179 INFO L225 Difference]: With dead ends: 335 [2025-01-09 10:53:14,179 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 10:53:14,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-01-09 10:53:14,180 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 92 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:14,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 292 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 24.5s Time] [2025-01-09 10:53:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 10:53:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2025-01-09 10:53:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 169 states have (on average 1.2011834319526626) internal successors, (203), 169 states have internal predecessors, (203), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 10:53:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 335 transitions. [2025-01-09 10:53:14,229 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 335 transitions. Word has length 152 [2025-01-09 10:53:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:14,230 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 335 transitions. [2025-01-09 10:53:14,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 10:53:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 335 transitions. [2025-01-09 10:53:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:53:14,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:14,232 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:14,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 10:53:14,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:14,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:14,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -596773106, now seen corresponding path program 1 times [2025-01-09 10:53:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426879594] [2025-01-09 10:53:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:14,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:14,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 10:53:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:53:14,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:53:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:14,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:53:14,921 INFO L279 TraceCheckSpWp]: Computing forward predicates...