./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.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_variablewrapping_wrapper-sp_file-28.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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:08:20,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:08:20,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:08:20,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:08:20,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:08:20,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:08:20,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:08:20,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:08:20,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:08:20,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:08:20,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:08:20,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:08:20,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:08:20,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:08:20,738 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:08:20,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:08:20,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:08:20,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:08:20,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:08:20,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:20,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:20,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:20,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:20,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:20,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:08:20,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:08:20,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:08:20,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:08:20,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:08:20,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:08:20,742 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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-01-09 16:08:20,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:08:20,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:08:21,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:08:21,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:08:21,003 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:08:21,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:22,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08fe896/63f6d28437f642189a10b210ebd0e48b/FLAGa463b7e2b [2025-01-09 16:08:22,388 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:08:22,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:22,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08fe896/63f6d28437f642189a10b210ebd0e48b/FLAGa463b7e2b [2025-01-09 16:08:22,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08fe896/63f6d28437f642189a10b210ebd0e48b [2025-01-09 16:08:22,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:08:22,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:08:22,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:22,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:08:22,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:08:22,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448633cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22, skipping insertion in model container [2025-01-09 16:08:22,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:08:22,593 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_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-01-09 16:08:22,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:22,709 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:08:22,716 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_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-01-09 16:08:22,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:22,755 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:08:22,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22 WrapperNode [2025-01-09 16:08:22,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:22,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:22,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:08:22,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:08:22,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,792 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2025-01-09 16:08:22,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:22,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:08:22,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:08:22,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:08:22,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,809 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:08:22,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:08:22,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:08:22,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:08:22,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:08:22,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (1/1) ... [2025-01-09 16:08:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:22,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:22,856 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 16:08:22,864 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 16:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:08:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:08:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:08:22,962 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:08:22,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:08:23,469 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-01-09 16:08:23,469 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:08:23,483 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:08:23,483 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:08:23,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:23 BoogieIcfgContainer [2025-01-09 16:08:23,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:08:23,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:08:23,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:08:23,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:08:23,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:08:22" (1/3) ... [2025-01-09 16:08:23,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bc395a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:23, skipping insertion in model container [2025-01-09 16:08:23,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:22" (2/3) ... [2025-01-09 16:08:23,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bc395a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:23, skipping insertion in model container [2025-01-09 16:08:23,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:23" (3/3) ... [2025-01-09 16:08:23,492 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:23,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:08:23,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:08:23,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:08:23,562 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;@406b220e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:08:23,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:08:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 16:08:23,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:23,575 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:23,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:23,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1107799878, now seen corresponding path program 1 times [2025-01-09 16:08:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973954617] [2025-01-09 16:08:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:23,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 16:08:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:23,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973954617] [2025-01-09 16:08:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973954617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561700441] [2025-01-09 16:08:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:23,895 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 16:08:23,906 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 16:08:24,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:24,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:24,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:08:24,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 16:08:24,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561700441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:08:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:08:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235526537] [2025-01-09 16:08:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:08:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:08:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:24,150 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:24,167 INFO L93 Difference]: Finished difference Result 238 states and 365 transitions. [2025-01-09 16:08:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:08:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-01-09 16:08:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:24,172 INFO L225 Difference]: With dead ends: 238 [2025-01-09 16:08:24,172 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 16:08:24,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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 16:08:24,176 INFO L435 NwaCegarLoop]: 171 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, 171 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 16:08:24,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 16:08:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 16:08:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-01-09 16:08:24,201 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2025-01-09 16:08:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:24,201 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-01-09 16:08:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-01-09 16:08:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 16:08:24,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:24,204 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:24,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:24,408 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 16:08:24,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:24,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1720770866, now seen corresponding path program 1 times [2025-01-09 16:08:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424666475] [2025-01-09 16:08:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:24,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:24,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:24,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:24,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:24,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424666475] [2025-01-09 16:08:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424666475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195678867] [2025-01-09 16:08:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:24,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:24,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:24,773 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:24,801 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2025-01-09 16:08:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-01-09 16:08:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:24,802 INFO L225 Difference]: With dead ends: 238 [2025-01-09 16:08:24,802 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 16:08:24,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:24,803 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:24,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 16:08:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-01-09 16:08:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-01-09 16:08:24,811 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2025-01-09 16:08:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:24,812 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-01-09 16:08:24,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-01-09 16:08:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 16:08:24,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:24,814 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:08:24,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 54236496, now seen corresponding path program 1 times [2025-01-09 16:08:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420766292] [2025-01-09 16:08:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:24,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:24,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420766292] [2025-01-09 16:08:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420766292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841346320] [2025-01-09 16:08:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:24,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:24,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:24,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:24,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:24,965 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:24,986 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2025-01-09 16:08:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:24,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-01-09 16:08:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:24,989 INFO L225 Difference]: With dead ends: 242 [2025-01-09 16:08:24,989 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 16:08:24,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:24,990 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:24,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 16:08:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-01-09 16:08:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-01-09 16:08:24,997 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2025-01-09 16:08:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-01-09 16:08:24,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-01-09 16:08:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 16:08:24,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:24,999 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:24,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:08:24,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 56083538, now seen corresponding path program 1 times [2025-01-09 16:08:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:24,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794137943] [2025-01-09 16:08:24,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:25,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:25,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:25,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794137943] [2025-01-09 16:08:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794137943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98062615] [2025-01-09 16:08:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:26,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:26,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:26,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:26,071 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:26,504 INFO L93 Difference]: Finished difference Result 303 states and 430 transitions. [2025-01-09 16:08:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-01-09 16:08:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:26,506 INFO L225 Difference]: With dead ends: 303 [2025-01-09 16:08:26,506 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 16:08:26,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:08:26,507 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 223 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:26,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 641 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:08:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 16:08:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 140. [2025-01-09 16:08:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2025-01-09 16:08:26,527 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 130 [2025-01-09 16:08:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2025-01-09 16:08:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2025-01-09 16:08:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 16:08:26,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:26,532 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:08:26,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:26,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1486076887, now seen corresponding path program 1 times [2025-01-09 16:08:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892591402] [2025-01-09 16:08:26,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:26,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 16:08:26,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 16:08:26,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:26,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892591402] [2025-01-09 16:08:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892591402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:08:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814710026] [2025-01-09 16:08:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:29,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:08:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:29,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:08:29,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:08:29,410 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:08:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:30,881 INFO L93 Difference]: Finished difference Result 297 states and 424 transitions. [2025-01-09 16:08:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:08:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-01-09 16:08:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:30,883 INFO L225 Difference]: With dead ends: 297 [2025-01-09 16:08:30,883 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 16:08:30,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:08:30,884 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 288 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:30,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 606 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:08:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 16:08:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-01-09 16:08:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2025-01-09 16:08:30,895 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 132 [2025-01-09 16:08:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2025-01-09 16:08:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:08:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2025-01-09 16:08:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 16:08:30,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:30,896 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:30,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:08:30,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:30,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 668428437, now seen corresponding path program 1 times [2025-01-09 16:08:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809150112] [2025-01-09 16:08:30,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:30,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 16:08:30,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 16:08:30,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:30,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809150112] [2025-01-09 16:08:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809150112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:08:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249312767] [2025-01-09 16:08:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:32,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:08:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:32,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:08:32,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:08:32,029 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:08:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:32,672 INFO L93 Difference]: Finished difference Result 328 states and 466 transitions. [2025-01-09 16:08:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:32,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-01-09 16:08:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:32,675 INFO L225 Difference]: With dead ends: 328 [2025-01-09 16:08:32,675 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 16:08:32,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:32,677 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 309 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 574 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:08:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 16:08:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157. [2025-01-09 16:08:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2025-01-09 16:08:32,695 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 132 [2025-01-09 16:08:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:32,695 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2025-01-09 16:08:32,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:08:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2025-01-09 16:08:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:08:32,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:32,698 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:32,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:08:32,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:32,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1178975826, now seen corresponding path program 1 times [2025-01-09 16:08:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161256114] [2025-01-09 16:08:32,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:32,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:32,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:08:32,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:08:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:32,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161256114] [2025-01-09 16:08:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161256114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:32,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:32,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359382542] [2025-01-09 16:08:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:32,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:32,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:32,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:32,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:32,881 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:32,987 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2025-01-09 16:08:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-01-09 16:08:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:32,988 INFO L225 Difference]: With dead ends: 311 [2025-01-09 16:08:32,988 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 16:08:32,989 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 16:08:32,989 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:32,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:08:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 16:08:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 16:08:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 217 transitions. [2025-01-09 16:08:33,005 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 217 transitions. Word has length 134 [2025-01-09 16:08:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:33,006 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 217 transitions. [2025-01-09 16:08:33,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 217 transitions. [2025-01-09 16:08:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:08:33,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:33,008 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:08:33,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -815168880, now seen corresponding path program 1 times [2025-01-09 16:08:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963362701] [2025-01-09 16:08:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:33,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:08:33,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:08:33,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:33,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:08:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963362701] [2025-01-09 16:08:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963362701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194416990] [2025-01-09 16:08:33,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:33,515 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 16:08:33,516 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 16:08:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:08:33,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:08:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:33,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 16:08:33,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:33,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:08:34,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:34,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:34,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:34,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:34,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:34,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:08:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 16:08:34,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:08:34,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194416990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:34,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:08:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2025-01-09 16:08:34,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427444002] [2025-01-09 16:08:34,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:08:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:08:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:34,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:08:34,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:08:34,569 INFO L87 Difference]: Start difference. First operand 157 states and 217 transitions. Second operand has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2025-01-09 16:08:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:35,360 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-01-09 16:08:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:08:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 134 [2025-01-09 16:08:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:35,363 INFO L225 Difference]: With dead ends: 318 [2025-01-09 16:08:35,363 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 16:08:35,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:08:35,365 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 291 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:35,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 801 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:08:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 16:08:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2025-01-09 16:08:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.352112676056338) internal successors, (192), 143 states have internal predecessors, (192), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 228 transitions. [2025-01-09 16:08:35,387 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 228 transitions. Word has length 134 [2025-01-09 16:08:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 228 transitions. [2025-01-09 16:08:35,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2025-01-09 16:08:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 228 transitions. [2025-01-09 16:08:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:08:35,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:35,390 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:35,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:08:35,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:35,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:35,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2133207236, now seen corresponding path program 1 times [2025-01-09 16:08:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634316302] [2025-01-09 16:08:35,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:35,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:08:35,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:08:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:08:35,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:08:35,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:08:35,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:08:35,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:35,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:08:36,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:08:36,048 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:08:36,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:08:36,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:08:36,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:36,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:08:36,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:08:36 BoogieIcfgContainer [2025-01-09 16:08:36,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:08:36,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:08:36,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:08:36,180 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:08:36,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:23" (3/4) ... [2025-01-09 16:08:36,182 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:08:36,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:08:36,183 INFO L158 Benchmark]: Toolchain (without parser) took 13758.21ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 116.6MB in the beginning and 566.2MB in the end (delta: -449.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,184 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:36,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.61ms. Allocated memory is still 142.6MB. Free memory was 116.0MB in the beginning and 99.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.35ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 95.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:08:36,184 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,184 INFO L158 Benchmark]: RCFGBuilder took 654.98ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 55.0MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,185 INFO L158 Benchmark]: TraceAbstraction took 12693.77ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 55.0MB in the beginning and 566.5MB in the end (delta: -511.5MB). Peak memory consumption was 324.6MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,185 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 629.1MB. Free memory was 566.5MB in the beginning and 566.2MB in the end (delta: 312.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:08:36,186 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.61ms. Allocated memory is still 142.6MB. Free memory was 116.0MB in the beginning and 99.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.35ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 95.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 654.98ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 55.0MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12693.77ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 55.0MB in the beginning and 566.5MB in the end (delta: -511.5MB). Peak memory consumption was 324.6MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 629.1MB. Free memory was 566.5MB in the beginning and 566.2MB in the end (delta: 312.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; [L57] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L70] signed short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L71] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L75] signed long int stepLocal_0 = -4; [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_0=-4] [L76] COND TRUE stepLocal_0 < (*(WrapperStruct00_var_1_6_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] (*(WrapperStruct00_var_1_11_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L82] COND TRUE ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] EXPR (*(WrapperStruct00_var_1_6_Pointer)) | 5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_6_Pointer)) | 5; [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] COND FALSE !(stepLocal_1 <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L91] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) [L122] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122-L123] return ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1113 mSDsluCounter, 4062 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2906 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 1156 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=8, InterpolantAutomatonStates: 47, 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, 8 MinimizatonAttempts, 76 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1450 NumberOfCodeBlocks, 1450 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1306 ConstructedInterpolants, 0 QuantifiedInterpolants, 9559 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3470/3640 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 16:08:36,211 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_variablewrapping_wrapper-sp_file-28.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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:08:38,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:08:38,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:08:38,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:08:38,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:08:38,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:08:38,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:08:38,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:08:38,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:08:38,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:08:38,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:08:38,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:08:38,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:08:38,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:08:38,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:38,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:38,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:08:38,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:08:38,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:08:38,318 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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-01-09 16:08:38,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:08:38,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:08:38,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:08:38,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:08:38,594 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:08:38,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:39,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bc87c571/25e07ebaf2ff44bf85c8c11e1f2efb50/FLAG8e039f2ff [2025-01-09 16:08:40,032 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:08:40,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:40,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bc87c571/25e07ebaf2ff44bf85c8c11e1f2efb50/FLAG8e039f2ff [2025-01-09 16:08:40,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bc87c571/25e07ebaf2ff44bf85c8c11e1f2efb50 [2025-01-09 16:08:40,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:08:40,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:08:40,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:40,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:08:40,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:08:40,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a89077c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40, skipping insertion in model container [2025-01-09 16:08:40,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:08:40,512 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_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-01-09 16:08:40,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:40,573 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:08:40,581 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_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-01-09 16:08:40,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:08:40,626 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:08:40,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40 WrapperNode [2025-01-09 16:08:40,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:08:40,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:40,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:08:40,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:08:40,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,669 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 564 [2025-01-09 16:08:40,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:08:40,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:08:40,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:08:40,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:08:40,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,708 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-01-09 16:08:40,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:08:40,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:08:40,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:08:40,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:08:40,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (1/1) ... [2025-01-09 16:08:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:08:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:40,786 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 16:08:40,793 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 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:08:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:08:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:08:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:08:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:08:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:08:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:08:40,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:08:40,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:08:42,392 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-01-09 16:08:42,393 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:08:42,401 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:08:42,401 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:08:42,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:42 BoogieIcfgContainer [2025-01-09 16:08:42,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:08:42,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:08:42,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:08:42,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:08:42,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:08:40" (1/3) ... [2025-01-09 16:08:42,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e99d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:42, skipping insertion in model container [2025-01-09 16:08:42,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:08:40" (2/3) ... [2025-01-09 16:08:42,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e99d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:42, skipping insertion in model container [2025-01-09 16:08:42,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:42" (3/3) ... [2025-01-09 16:08:42,411 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-01-09 16:08:42,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:08:42,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:08:42,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:08:42,469 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;@5e377227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:08:42,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:08:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:42,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:42,491 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:42,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:42,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 292955005, now seen corresponding path program 1 times [2025-01-09 16:08:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465371373] [2025-01-09 16:08:42,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:42,505 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 16:08:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:42,508 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 16:08:42,509 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 16:08:42,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:42,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:42,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:42,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:08:42,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 16:08:42,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:42,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465371373] [2025-01-09 16:08:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465371373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:42,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:42,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:08:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670220275] [2025-01-09 16:08:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:42,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:08:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:42,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:08:42,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:42,946 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:42,964 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-01-09 16:08:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:08:42,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-01-09 16:08:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:42,969 INFO L225 Difference]: With dead ends: 222 [2025-01-09 16:08:42,970 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:08:42,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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 16:08:42,973 INFO L435 NwaCegarLoop]: 161 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, 161 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 16:08:42,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:08:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 16:08:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-01-09 16:08:43,022 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2025-01-09 16:08:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:43,023 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-01-09 16:08:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-01-09 16:08:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:43,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:43,029 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:43,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:08:43,230 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 16:08:43,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:43,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1320248977, now seen corresponding path program 1 times [2025-01-09 16:08:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119373590] [2025-01-09 16:08:43,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:43,233 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 16:08:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:43,236 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 16:08:43,237 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 16:08:43,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:43,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:43,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:43,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:43,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:08:43,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:43,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:43,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119373590] [2025-01-09 16:08:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119373590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:08:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909566896] [2025-01-09 16:08:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:43,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:43,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:43,601 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:43,665 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-01-09 16:08:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-01-09 16:08:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:43,666 INFO L225 Difference]: With dead ends: 226 [2025-01-09 16:08:43,666 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 16:08:43,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:43,667 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:43,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 16:08:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-01-09 16:08:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2025-01-09 16:08:43,674 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 128 [2025-01-09 16:08:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:43,678 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2025-01-09 16:08:43,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2025-01-09 16:08:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:43,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:43,679 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:43,699 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 16:08:43,880 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 16:08:43,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1199710957, now seen corresponding path program 1 times [2025-01-09 16:08:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596949449] [2025-01-09 16:08:43,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:43,881 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 16:08:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:43,884 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 16:08:43,885 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 16:08:43,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:44,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:08:44,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:44,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:44,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596949449] [2025-01-09 16:08:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596949449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671484436] [2025-01-09 16:08:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:44,216 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:44,274 INFO L93 Difference]: Finished difference Result 234 states and 335 transitions. [2025-01-09 16:08:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-01-09 16:08:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:44,275 INFO L225 Difference]: With dead ends: 234 [2025-01-09 16:08:44,275 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:08:44,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:44,276 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:44,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 892 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:08:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-01-09 16:08:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2025-01-09 16:08:44,284 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 128 [2025-01-09 16:08:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:44,284 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2025-01-09 16:08:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2025-01-09 16:08:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:44,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:44,287 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:44,298 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:44,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:44,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1197863915, now seen corresponding path program 1 times [2025-01-09 16:08:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:44,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654043513] [2025-01-09 16:08:44,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:44,491 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 16:08:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:44,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:44,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:08:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:44,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:44,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:44,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:08:44,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:44,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:08:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:08:44,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:44,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:44,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654043513] [2025-01-09 16:08:44,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654043513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:44,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:44,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423220958] [2025-01-09 16:08:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:44,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:44,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:44,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:44,886 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:46,397 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2025-01-09 16:08:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-01-09 16:08:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:46,399 INFO L225 Difference]: With dead ends: 236 [2025-01-09 16:08:46,399 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:08:46,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:46,400 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:46,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 461 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 16:08:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:08:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-01-09 16:08:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-01-09 16:08:46,409 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 128 [2025-01-09 16:08:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:46,412 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-01-09 16:08:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:08:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-01-09 16:08:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 16:08:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:46,415 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:46,424 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 (5)] Ended with exit code 0 [2025-01-09 16:08:46,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:46,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1212974715, now seen corresponding path program 1 times [2025-01-09 16:08:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31503000] [2025-01-09 16:08:46,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:46,617 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 16:08:46,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:46,622 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 16:08:46,623 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 16:08:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 16:08:46,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 16:08:46,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:46,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:08:46,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:47,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:08:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 16:08:47,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:47,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31503000] [2025-01-09 16:08:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31503000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:47,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:47,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790321393] [2025-01-09 16:08:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:47,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:47,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:47,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:47,036 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:48,489 INFO L93 Difference]: Finished difference Result 236 states and 334 transitions. [2025-01-09 16:08:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-01-09 16:08:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:48,490 INFO L225 Difference]: With dead ends: 236 [2025-01-09 16:08:48,490 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:08:48,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:48,491 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:48,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 456 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 16:08:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:08:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-01-09 16:08:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:08:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2025-01-09 16:08:48,500 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 130 [2025-01-09 16:08:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:48,500 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2025-01-09 16:08:48,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:08:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2025-01-09 16:08:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 16:08:48,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:48,504 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:48,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 16:08:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:08:48,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 274297813, now seen corresponding path program 1 times [2025-01-09 16:08:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:08:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574246922] [2025-01-09 16:08:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:48,706 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 16:08:48,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:08:48,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:08:48,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 16:08:48,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 16:08:49,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 16:08:49,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:49,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:49,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 16:08:49,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:49,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:08:49,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:49,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:50,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:50,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:50,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 16:08:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 16:08:50,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:08:50,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:08:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574246922] [2025-01-09 16:08:50,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574246922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1844830002] [2025-01-09 16:08:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:50,426 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:08:50,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:08:50,431 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:08:50,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 16:08:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 16:08:51,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 16:08:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:51,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:52,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:08:52,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:08:52,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-01-09 16:08:53,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:53,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:53,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:53,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 16:08:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 159 proven. 117 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 16:08:53,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:08:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1844830002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:53,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:08:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2025-01-09 16:08:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62903279] [2025-01-09 16:08:53,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:08:53,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:08:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:08:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:08:53,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:08:53,897 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 16:08:55,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:08:56,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:08:58,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:08:59,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:09:00,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:09:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:02,987 INFO L93 Difference]: Finished difference Result 267 states and 368 transitions. [2025-01-09 16:09:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:09:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) Word has length 132 [2025-01-09 16:09:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:02,992 INFO L225 Difference]: With dead ends: 267 [2025-01-09 16:09:02,992 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 16:09:02,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:09:02,996 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 184 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:02,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 529 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-01-09 16:09:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 16:09:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-01-09 16:09:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 128 states have internal predecessors, (166), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:09:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2025-01-09 16:09:03,021 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 132 [2025-01-09 16:09:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2025-01-09 16:09:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 16:09:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2025-01-09 16:09:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:09:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:03,022 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:03,037 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 (7)] Ended with exit code 0 [2025-01-09 16:09:03,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-01-09 16:09:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 16:09:03,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 823058170, now seen corresponding path program 1 times [2025-01-09 16:09:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:09:03,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948803277] [2025-01-09 16:09:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:03,428 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 16:09:03,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:09:03,431 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:09:03,432 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 (9)] Waiting until timeout for monitored process [2025-01-09 16:09:03,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:09:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:09:03,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:03,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:03,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 16:09:04,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:05,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:09:06,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-01-09 16:09:07,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 16:09:08,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:08,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:09,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:10,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:11,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:11,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2025-01-09 16:09:11,559 INFO L349 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2025-01-09 16:09:11,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 286 treesize of output 287 [2025-01-09 16:09:12,007 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:09:12,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 157 [2025-01-09 16:09:12,050 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-01-09 16:09:12,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2025-01-09 16:09:12,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2025-01-09 16:09:12,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2025-01-09 16:09:12,169 INFO L349 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2025-01-09 16:09:12,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 155 treesize of output 161 [2025-01-09 16:09:14,341 INFO L349 Elim1Store]: treesize reduction 73, result has 13.1 percent of original size [2025-01-09 16:09:14,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 276 treesize of output 197 [2025-01-09 16:09:14,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:09:14,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 362 treesize of output 250 [2025-01-09 16:09:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 167 proven. 123 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-09 16:09:17,301 INFO L312 TraceCheckSpWp]: Computing backward predicates...