./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.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-ps-ci_file-5.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 bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:41:55,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:41:55,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:41:55,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:41:55,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:41:55,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:41:55,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:41:55,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:41:55,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:41:55,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:41:55,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:41:55,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:41:55,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:41:55,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:41:55,999 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:41:56,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:41:56,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:41:56,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:41:56,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:41:56,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:41:56,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:41:56,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:41:56,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:41:56,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:41:56,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:41:56,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:41:56,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:41:56,003 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 -> bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 [2025-01-09 11:41:56,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:41:56,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:41:56,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:41:56,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:41:56,256 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:41:56,256 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-ps-ci_file-5.i [2025-01-09 11:41:57,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a97dc481/7943ca7271954e28bcd5a2ca2c290b46/FLAGcd4e3dbf4 [2025-01-09 11:41:57,712 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:41:57,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2025-01-09 11:41:57,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a97dc481/7943ca7271954e28bcd5a2ca2c290b46/FLAGcd4e3dbf4 [2025-01-09 11:41:57,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a97dc481/7943ca7271954e28bcd5a2ca2c290b46 [2025-01-09 11:41:57,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:41:57,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:41:57,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:41:57,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:41:57,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:41:57,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:57,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a66a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57, skipping insertion in model container [2025-01-09 11:41:57,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:57,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:41:57,872 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-ps-ci_file-5.i[918,931] [2025-01-09 11:41:57,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:41:57,926 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:41:57,932 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-ps-ci_file-5.i[918,931] [2025-01-09 11:41:57,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:41:57,973 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:41:57,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57 WrapperNode [2025-01-09 11:41:57,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:41:57,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:41:57,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:41:57,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:41:57,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:57,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,020 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-01-09 11:41:58,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:41:58,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:41:58,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:41:58,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:41:58,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,048 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 11:41:58,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:41:58,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:41:58,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:41:58,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:41:58,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (1/1) ... [2025-01-09 11:41:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:41:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:41:58,094 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 11:41:58,099 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 11:41:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:41:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:41:58,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:41:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:41:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:41:58,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:41:58,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:41:58,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:41:58,468 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 11:41:58,468 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:41:58,479 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:41:58,479 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:41:58,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:41:58 BoogieIcfgContainer [2025-01-09 11:41:58,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:41:58,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:41:58,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:41:58,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:41:58,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:41:57" (1/3) ... [2025-01-09 11:41:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10607e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:41:58, skipping insertion in model container [2025-01-09 11:41:58,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:41:57" (2/3) ... [2025-01-09 11:41:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10607e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:41:58, skipping insertion in model container [2025-01-09 11:41:58,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:41:58" (3/3) ... [2025-01-09 11:41:58,490 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2025-01-09 11:41:58,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:41:58,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:41:58,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:41:58,559 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;@ddb2292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:41:58,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:41:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 11:41:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 11:41:58,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:41:58,574 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:58,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:41:58,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:41:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1043490848, now seen corresponding path program 1 times [2025-01-09 11:41:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:41:58,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942540614] [2025-01-09 11:41:58,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:41:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:41:58,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:41:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:41:58,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:41:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:41:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 11:41:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:41:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942540614] [2025-01-09 11:41:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942540614] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:41:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127063253] [2025-01-09 11:41:58,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:41:58,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:41:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:41:58,849 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 11:41:58,851 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 11:41:58,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:41:58,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:41:58,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:41:58,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:41:58,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:41:58,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:41:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 11:41:59,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:41:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127063253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:41:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:41:59,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:41:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37938457] [2025-01-09 11:41:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:41:59,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:41:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:41:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:41:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:41:59,044 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:41:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:41:59,066 INFO L93 Difference]: Finished difference Result 140 states and 240 transitions. [2025-01-09 11:41:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:41:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2025-01-09 11:41:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:41:59,073 INFO L225 Difference]: With dead ends: 140 [2025-01-09 11:41:59,073 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 11:41:59,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:41:59,077 INFO L435 NwaCegarLoop]: 106 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, 106 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 11:41:59,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:41:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 11:41:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 11:41:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 11:41:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-01-09 11:41:59,110 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 132 [2025-01-09 11:41:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:41:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-01-09 11:41:59,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:41:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-01-09 11:41:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 11:41:59,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:41:59,118 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:59,124 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 11:41:59,318 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 11:41:59,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:41:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:41:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1221173155, now seen corresponding path program 1 times [2025-01-09 11:41:59,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:41:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972530231] [2025-01-09 11:41:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:41:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:41:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 11:41:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 11:41:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:41:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:41:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:41:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:41:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972530231] [2025-01-09 11:41:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972530231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:41:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:41:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:41:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647164125] [2025-01-09 11:41:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:41:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:41:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:41:59,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:41:59,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:41:59,492 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 11:41:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:41:59,542 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2025-01-09 11:41:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:41:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2025-01-09 11:41:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:41:59,546 INFO L225 Difference]: With dead ends: 185 [2025-01-09 11:41:59,546 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 11:41:59,546 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 11:41:59,549 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:41:59,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:41:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 11:41:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2025-01-09 11:41:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3375) internal successors, (107), 81 states have internal predecessors, (107), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:41:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-01-09 11:41:59,571 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 133 [2025-01-09 11:41:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:41:59,571 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-01-09 11:41:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 11:41:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-01-09 11:41:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 11:41:59,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:41:59,575 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:59,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:41:59,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:41:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:41:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -772971551, now seen corresponding path program 1 times [2025-01-09 11:41:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:41:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210438457] [2025-01-09 11:41:59,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:41:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:41:59,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 11:41:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 11:41:59,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:41:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 11:42:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:42:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210438457] [2025-01-09 11:42:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210438457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:42:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:42:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:42:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006686449] [2025-01-09 11:42:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:42:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:42:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:42:00,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:42:00,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:42:00,974 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 11:42:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:42:01,682 INFO L93 Difference]: Finished difference Result 379 states and 568 transitions. [2025-01-09 11:42:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:42:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2025-01-09 11:42:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:42:01,686 INFO L225 Difference]: With dead ends: 379 [2025-01-09 11:42:01,686 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 11:42:01,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:42:01,688 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 245 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:42:01,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 634 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:42:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 11:42:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 178. [2025-01-09 11:42:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.3414634146341464) internal successors, (165), 124 states have internal predecessors, (165), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 11:42:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2025-01-09 11:42:01,706 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 133 [2025-01-09 11:42:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:42:01,706 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2025-01-09 11:42:01,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 11:42:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2025-01-09 11:42:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 11:42:01,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:42:01,708 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:01,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:42:01,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:42:01,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:42:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash -350269725, now seen corresponding path program 1 times [2025-01-09 11:42:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:42:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040617736] [2025-01-09 11:42:01,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:42:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 11:42:01,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 11:42:01,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:01,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:42:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279347489] [2025-01-09 11:42:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:42:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:42:01,802 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 11:42:01,804 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 11:42:01,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 11:42:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 11:42:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:42:02,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:42:02,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 11:42:02,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 11:42:02,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:02,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:42:02,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:42:02,535 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:42:02,536 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:42:02,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:42:02,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:42:02,740 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 11:42:02,811 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:42:02,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:42:02 BoogieIcfgContainer [2025-01-09 11:42:02,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:42:02,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:42:02,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:42:02,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:42:02,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:41:58" (3/4) ... [2025-01-09 11:42:02,820 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:42:02,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:42:02,821 INFO L158 Benchmark]: Toolchain (without parser) took 5085.58ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 109.2MB in the beginning and 204.4MB in the end (delta: -95.2MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2025-01-09 11:42:02,821 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:42:02,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.93ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 94.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:42:02,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 89.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:42:02,822 INFO L158 Benchmark]: Boogie Preprocessor took 50.10ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 82.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:42:02,822 INFO L158 Benchmark]: RCFGBuilder took 407.79ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 57.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:42:02,822 INFO L158 Benchmark]: TraceAbstraction took 4334.17ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 57.1MB in the beginning and 204.5MB in the end (delta: -147.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2025-01-09 11:42:02,822 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 310.4MB. Free memory was 204.5MB in the beginning and 204.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:42:02,823 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.93ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 94.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 89.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.10ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 82.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 407.79ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 57.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4334.17ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 57.1MB in the beginning and 204.5MB in the end (delta: -147.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 310.4MB. Free memory was 204.5MB in the beginning and 204.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 87, overapproximation of someBinaryArithmeticDOUBLEoperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] signed long int var_1_22 = -32; [L39] signed char var_1_26 = 25; [L40] signed char var_1_27 = 4; [L41] unsigned long int var_1_28 = 32; [L42] signed short int var_1_30 = 5; [L43] unsigned long int var_1_32 = 4; [L44] float var_1_34 = 31.25; [L45] double var_1_39 = 7.4; [L46] signed long int var_1_44 = 25; [L47] unsigned short int last_1_var_1_12 = 25; [L48] double last_1_var_1_15 = 64.375; VAL [isInitial=0, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L170] isInitial = 1 [L171] FCALL initially() [L173] CALL updateLastVariables() [L162] last_1_var_1_12 = var_1_12 [L163] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L173] RET updateLastVariables() [L174] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L136] var_1_10 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L142] var_1_14 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L143] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L145] var_1_16 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L146] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L147] var_1_17 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L148] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L150] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L151] var_1_20 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L154] var_1_26 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_26 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L155] RET assume_abort_if_not(var_1_26 >= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_26 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] RET assume_abort_if_not(var_1_26 <= 32) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_27 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] RET assume_abort_if_not(var_1_27 <= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L174] RET updateVariables() [L175] CALL step() [L52] EXPR ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >> (var_1_26 - var_1_27) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L52] COND FALSE !(var_1_4 <= (((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >> (var_1_26 - var_1_27))) [L55] var_1_22 = var_1_5 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L57] COND TRUE 8.4 <= var_1_16 [L58] var_1_28 = (((((((var_1_1) < (var_1_12)) ? (var_1_1) : (var_1_12))) < 0 ) ? -((((var_1_1) < (var_1_12)) ? (var_1_1) : (var_1_12))) : ((((var_1_1) < (var_1_12)) ? (var_1_1) : (var_1_12))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L62] COND TRUE var_1_18 == ((((32.5) < (var_1_17)) ? (32.5) : (var_1_17))) [L63] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L73] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L76] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L85] COND TRUE -256 < (var_1_4 * 10) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L86] COND TRUE var_1_17 >= var_1_16 [L87] var_1_39 = (((((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) > (var_1_16)) ? (((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) : (var_1_16))) - var_1_16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=25, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L92] var_1_44 = var_1_1 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L93] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L98] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L101] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L103] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L104] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L108] var_1_21 = var_1_10 [L109] unsigned long int stepLocal_3 = var_1_6; [L110] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=128, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L111] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L116] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=128, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=25, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L117] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L118] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L122] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L123] COND TRUE stepLocal_1 <= var_1_12 [L124] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L175] RET step() [L176] CALL, EXPR property() [L166-L167] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L176] RET, EXPR property() [L176] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=127, var_1_11=64, var_1_12=16388, var_1_14=147455, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=127, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=-256, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 1001 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 384 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 92 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 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 11:42:02,839 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-ps-ci_file-5.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 bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:42:04,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:42:04,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:42:04,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:42:04,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:42:04,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:42:04,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:42:04,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:42:04,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:42:04,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:42:04,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:42:04,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:42:04,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:42:04,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:42:04,802 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:42:04,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:42:04,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:42:04,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:42:04,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:42:04,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:42:04,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:42:04,805 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:42:04,806 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:42:04,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:42:04,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:42:04,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:42:04,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:42:04,806 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 -> bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 [2025-01-09 11:42:05,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:42:05,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:42:05,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:42:05,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:42:05,057 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:42:05,058 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-ps-ci_file-5.i [2025-01-09 11:42:06,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f08a2a6/a963151e00524c60bb30bb56d56d39a9/FLAG187df0fb3 [2025-01-09 11:42:06,481 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:42:06,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2025-01-09 11:42:06,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f08a2a6/a963151e00524c60bb30bb56d56d39a9/FLAG187df0fb3 [2025-01-09 11:42:06,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24f08a2a6/a963151e00524c60bb30bb56d56d39a9 [2025-01-09 11:42:06,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:42:06,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:42:06,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:42:06,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:42:06,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:42:06,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467efdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06, skipping insertion in model container [2025-01-09 11:42:06,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:42:06,630 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-ps-ci_file-5.i[918,931] [2025-01-09 11:42:06,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:42:06,696 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:42:06,707 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-ps-ci_file-5.i[918,931] [2025-01-09 11:42:06,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:42:06,749 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:42:06,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06 WrapperNode [2025-01-09 11:42:06,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:42:06,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:42:06,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:42:06,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:42:06,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,781 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-01-09 11:42:06,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:42:06,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:42:06,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:42:06,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:42:06,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,801 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 11:42:06,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:42:06,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:42:06,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:42:06,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:42:06,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (1/1) ... [2025-01-09 11:42:06,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:42:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:42:06,858 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 11:42:06,861 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 11:42:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:42:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:42:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:42:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:42:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:42:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:42:06,938 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:42:06,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:42:07,672 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 11:42:07,672 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:42:07,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:42:07,679 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:42:07,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:42:07 BoogieIcfgContainer [2025-01-09 11:42:07,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:42:07,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:42:07,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:42:07,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:42:07,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:42:06" (1/3) ... [2025-01-09 11:42:07,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1695deba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:42:07, skipping insertion in model container [2025-01-09 11:42:07,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:42:06" (2/3) ... [2025-01-09 11:42:07,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1695deba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:42:07, skipping insertion in model container [2025-01-09 11:42:07,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:42:07" (3/3) ... [2025-01-09 11:42:07,686 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2025-01-09 11:42:07,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:42:07,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:42:07,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:42:07,741 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;@1c88c1ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:42:07,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:42:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 11:42:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:42:07,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:42:07,764 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:07,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:42:07,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:42:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash 698868457, now seen corresponding path program 1 times [2025-01-09 11:42:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:42:07,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965153802] [2025-01-09 11:42:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:07,776 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 11:42:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:42:07,778 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 11:42:07,780 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 11:42:07,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:42:08,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:42:08,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:08,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:08,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:42:08,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:42:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-01-09 11:42:08,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:42:08,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:42:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965153802] [2025-01-09 11:42:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965153802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:42:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:42:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:42:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219489330] [2025-01-09 11:42:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:42:08,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:42:08,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:42:08,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:42:08,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:42:08,060 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:42:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:42:08,074 INFO L93 Difference]: Finished difference Result 136 states and 234 transitions. [2025-01-09 11:42:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:42:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-01-09 11:42:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:42:08,081 INFO L225 Difference]: With dead ends: 136 [2025-01-09 11:42:08,081 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 11:42:08,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 11:42:08,086 INFO L435 NwaCegarLoop]: 103 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, 103 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 11:42:08,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:42:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 11:42:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 11:42:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 11:42:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2025-01-09 11:42:08,120 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 131 [2025-01-09 11:42:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:42:08,120 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2025-01-09 11:42:08,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 11:42:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2025-01-09 11:42:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 11:42:08,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:42:08,125 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:08,134 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:42:08,325 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 11:42:08,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:42:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:42:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -823976729, now seen corresponding path program 1 times [2025-01-09 11:42:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:42:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340624799] [2025-01-09 11:42:08,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:08,327 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 11:42:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:42:08,329 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 11:42:08,331 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 11:42:08,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:42:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:42:08,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:08,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:08,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:42:08,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:42:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-01-09 11:42:08,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:42:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 11:42:08,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:42:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340624799] [2025-01-09 11:42:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340624799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:42:08,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:42:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 11:42:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71460964] [2025-01-09 11:42:08,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:42:08,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:42:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:42:08,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:42:08,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:42:08,911 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:42:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:42:09,378 INFO L93 Difference]: Finished difference Result 139 states and 206 transitions. [2025-01-09 11:42:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:42:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 132 [2025-01-09 11:42:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:42:09,389 INFO L225 Difference]: With dead ends: 139 [2025-01-09 11:42:09,389 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 11:42:09,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:42:09,390 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:42:09,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 178 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:42:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 11:42:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-01-09 11:42:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 11:42:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2025-01-09 11:42:09,399 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 132 [2025-01-09 11:42:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:42:09,399 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2025-01-09 11:42:09,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:42:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2025-01-09 11:42:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 11:42:09,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:42:09,401 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:09,409 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 11:42:09,601 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 11:42:09,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:42:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:42:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1476845861, now seen corresponding path program 1 times [2025-01-09 11:42:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:42:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675796768] [2025-01-09 11:42:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:09,606 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 11:42:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:42:09,608 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 11:42:09,609 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 11:42:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:42:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:42:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:09,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:42:09,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:42:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 162 proven. 96 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:42:11,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:42:11,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:42:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675796768] [2025-01-09 11:42:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675796768] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:42:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1329901629] [2025-01-09 11:42:11,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:42:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:42:11,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:42:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 11:42:11,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:42:12,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:42:12,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:12,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:12,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 11:42:12,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:42:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 162 proven. 96 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:42:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:42:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1329901629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:42:13,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:42:13,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-01-09 11:42:13,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535673221] [2025-01-09 11:42:13,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:42:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:42:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:42:13,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:42:13,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:42:13,584 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 11:42:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:42:14,703 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2025-01-09 11:42:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 132 [2025-01-09 11:42:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:42:14,705 INFO L225 Difference]: With dead ends: 214 [2025-01-09 11:42:14,705 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 11:42:14,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:42:14,706 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 83 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:42:14,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 328 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:42:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 11:42:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2025-01-09 11:42:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 11:42:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 169 transitions. [2025-01-09 11:42:14,718 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 169 transitions. Word has length 132 [2025-01-09 11:42:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:42:14,718 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 169 transitions. [2025-01-09 11:42:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 11:42:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2025-01-09 11:42:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 11:42:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:42:14,720 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:14,729 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 11:42:14,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-01-09 11:42:15,124 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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:42:15,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:42:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:42:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1899547687, now seen corresponding path program 1 times [2025-01-09 11:42:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:42:15,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823027296] [2025-01-09 11:42:15,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:42:15,126 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 11:42:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:42:15,128 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 11:42:15,129 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 11:42:15,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 11:42:15,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 11:42:15,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:42:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:42:15,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 11:42:15,349 INFO L279 TraceCheckSpWp]: Computing forward predicates...