./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:26:53,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:26:53,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:26:53,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:26:53,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:26:53,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:26:53,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:26:53,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:26:53,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:26:53,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:26:53,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:26:53,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:26:53,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:26:53,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:26:53,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:26:53,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:26:53,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:26:53,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:53,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:26:53,349 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2025-03-08 16:26:53,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:26:53,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:26:53,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:26:53,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:26:53,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:26:53,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:26:54,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117e341c7/a592f2d6351c4d258296457323a275e6/FLAGc5885cdbe [2025-03-08 16:26:54,972 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:26:54,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:26:54,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117e341c7/a592f2d6351c4d258296457323a275e6/FLAGc5885cdbe [2025-03-08 16:26:55,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117e341c7/a592f2d6351c4d258296457323a275e6 [2025-03-08 16:26:55,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:26:55,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:26:55,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:55,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:26:55,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:26:55,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ce6f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55, skipping insertion in model container [2025-03-08 16:26:55,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:26:55,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2025-03-08 16:26:55,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:55,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:26:55,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2025-03-08 16:26:55,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:55,538 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:26:55,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55 WrapperNode [2025-03-08 16:26:55,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:55,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:55,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:26:55,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:26:55,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,581 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2025-03-08 16:26:55,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:55,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:26:55,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:26:55,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:26:55,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,603 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-03-08 16:26:55,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:26:55,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:26:55,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:26:55,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:26:55,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (1/1) ... [2025-03-08 16:26:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:55,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:26:55,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:26:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:26:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:26:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:26:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:26:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:26:55,781 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:26:55,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:26:56,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-08 16:26:56,097 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-08 16:26:56,097 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:26:56,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:26:56,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:26:56,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:56 BoogieIcfgContainer [2025-03-08 16:26:56,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:26:56,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:26:56,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:26:56,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:26:56,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:55" (1/3) ... [2025-03-08 16:26:56,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3345d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:56, skipping insertion in model container [2025-03-08 16:26:56,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:55" (2/3) ... [2025-03-08 16:26:56,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3345d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:56, skipping insertion in model container [2025-03-08 16:26:56,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:56" (3/3) ... [2025-03-08 16:26:56,113 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:26:56,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:26:56,125 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:26:56,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:26:56,184 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;@5b44dbf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:26:56,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:26:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:26:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:26:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:56,197 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:56,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:56,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-03-08 16:26:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181361861] [2025-03-08 16:26:56,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:56,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:56,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:26:56,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:26:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 16:26:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181361861] [2025-03-08 16:26:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181361861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:26:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954658355] [2025-03-08 16:26:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:56,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:26:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:56,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:26:56,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:26:56,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:26:56,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:26:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:56,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:56,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:26:56,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:26:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 16:26:56,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:26:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954658355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:26:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:26:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136398275] [2025-03-08 16:26:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:56,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:26:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:56,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:26:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:26:56,670 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:26:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:56,690 INFO L93 Difference]: Finished difference Result 166 states and 258 transitions. [2025-03-08 16:26:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:26:56,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-08 16:26:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:56,697 INFO L225 Difference]: With dead ends: 166 [2025-03-08 16:26:56,697 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 16:26:56,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:26:56,703 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:56,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 16:26:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 16:26:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:26:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-08 16:26:56,736 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2025-03-08 16:26:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:56,737 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-08 16:26:56,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:26:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-08 16:26:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:26:56,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:56,740 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:56,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:26:56,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:26:56,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-03-08 16:26:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287999737] [2025-03-08 16:26:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:56,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:26:57,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:26:57,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:57,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:26:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287999737] [2025-03-08 16:26:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287999737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:57,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:26:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815790390] [2025-03-08 16:26:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:57,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:26:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:57,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:26:57,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:26:57,286 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:26:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:57,322 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2025-03-08 16:26:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:26:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-08 16:26:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:57,325 INFO L225 Difference]: With dead ends: 163 [2025-03-08 16:26:57,325 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 16:26:57,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:26:57,327 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:57,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 16:26:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 16:26:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:26:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-08 16:26:57,335 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2025-03-08 16:26:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:57,335 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-08 16:26:57,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:26:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-08 16:26:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:26:57,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:57,337 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:57,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:26:57,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-03-08 16:26:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139391281] [2025-03-08 16:26:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:57,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:26:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:26:57,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:57,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:26:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:58,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139391281] [2025-03-08 16:26:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139391281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:58,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:26:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705821852] [2025-03-08 16:26:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:26:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:58,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:26:58,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:26:58,789 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:26:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:59,239 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-08 16:26:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:26:59,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2025-03-08 16:26:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:59,241 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:26:59,241 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 16:26:59,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:26:59,242 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 328 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 677 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:26:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 16:26:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-08 16:26:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.396551724137931) internal successors, (162), 117 states have internal predecessors, (162), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:26:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 194 transitions. [2025-03-08 16:26:59,274 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 194 transitions. Word has length 94 [2025-03-08 16:26:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:59,274 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 194 transitions. [2025-03-08 16:26:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:26:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 194 transitions. [2025-03-08 16:26:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:26:59,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:59,279 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:59,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:26:59,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-03-08 16:26:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:59,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966096863] [2025-03-08 16:26:59,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:26:59,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:26:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:26:59,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:59,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966096863] [2025-03-08 16:26:59,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966096863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:59,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:26:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995224296] [2025-03-08 16:26:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:59,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:26:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:59,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:26:59,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:59,626 INFO L87 Difference]: Start difference. First operand 135 states and 194 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:26:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:59,731 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2025-03-08 16:26:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:59,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-08 16:26:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:59,733 INFO L225 Difference]: With dead ends: 267 [2025-03-08 16:26:59,733 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 16:26:59,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:26:59,734 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 93 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:59,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 285 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 16:26:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 16:26:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 117 states have internal predecessors, (160), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:26:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2025-03-08 16:26:59,752 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 96 [2025-03-08 16:26:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:59,753 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2025-03-08 16:26:59,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:26:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2025-03-08 16:26:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:26:59,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:59,756 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:59,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:26:59,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-03-08 16:26:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129299042] [2025-03-08 16:26:59,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:59,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:26:59,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:26:59,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:00,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129299042] [2025-03-08 16:27:00,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129299042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:00,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:00,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:27:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063056320] [2025-03-08 16:27:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:00,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:27:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:00,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:27:00,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:27:00,705 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:01,372 INFO L93 Difference]: Finished difference Result 292 states and 415 transitions. [2025-03-08 16:27:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:27:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-08 16:27:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:01,374 INFO L225 Difference]: With dead ends: 292 [2025-03-08 16:27:01,374 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 16:27:01,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:27:01,375 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 324 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:01,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 575 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:27:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 16:27:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2025-03-08 16:27:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 91 states have internal predecessors, (121), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:27:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2025-03-08 16:27:01,392 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 96 [2025-03-08 16:27:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2025-03-08 16:27:01,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2025-03-08 16:27:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:27:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:01,396 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:01,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:27:01,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-03-08 16:27:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313461719] [2025-03-08 16:27:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:01,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:27:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:27:01,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:01,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:01,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313461719] [2025-03-08 16:27:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313461719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552282281] [2025-03-08 16:27:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:01,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:01,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:01,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:01,546 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:01,618 INFO L93 Difference]: Finished difference Result 233 states and 325 transitions. [2025-03-08 16:27:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:01,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-08 16:27:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:01,619 INFO L225 Difference]: With dead ends: 233 [2025-03-08 16:27:01,619 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 16:27:01,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:01,620 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 49 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:01,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 534 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 16:27:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2025-03-08 16:27:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 91 states have internal predecessors, (120), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:27:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-03-08 16:27:01,630 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 96 [2025-03-08 16:27:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:01,630 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-03-08 16:27:01,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-03-08 16:27:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:27:01,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:01,632 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:01,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:27:01,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:01,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-03-08 16:27:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:01,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052488262] [2025-03-08 16:27:01,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:27:01,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:27:01,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:01,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052488262] [2025-03-08 16:27:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052488262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533045816] [2025-03-08 16:27:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:01,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:01,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:01,744 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:01,808 INFO L93 Difference]: Finished difference Result 226 states and 312 transitions. [2025-03-08 16:27:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-08 16:27:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:01,810 INFO L225 Difference]: With dead ends: 226 [2025-03-08 16:27:01,810 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 16:27:01,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:01,811 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 38 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 421 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:01,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 421 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 16:27:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2025-03-08 16:27:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 91 states have internal predecessors, (119), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:27:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2025-03-08 16:27:01,821 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 97 [2025-03-08 16:27:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:01,821 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2025-03-08 16:27:01,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2025-03-08 16:27:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:27:01,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:01,822 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:27:01,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-03-08 16:27:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:01,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928603576] [2025-03-08 16:27:01,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:01,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:27:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:27:01,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:01,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928603576] [2025-03-08 16:27:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928603576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:02,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:27:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901629183] [2025-03-08 16:27:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:27:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:02,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:27:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:27:02,365 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:27:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:02,726 INFO L93 Difference]: Finished difference Result 284 states and 390 transitions. [2025-03-08 16:27:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:27:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-03-08 16:27:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:02,728 INFO L225 Difference]: With dead ends: 284 [2025-03-08 16:27:02,728 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 16:27:02,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:27:02,729 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 358 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:02,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 744 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:27:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 16:27:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-03-08 16:27:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 163 states have internal predecessors, (213), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:27:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions. [2025-03-08 16:27:02,756 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 98 [2025-03-08 16:27:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:02,756 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 263 transitions. [2025-03-08 16:27:02,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 16:27:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions. [2025-03-08 16:27:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:27:02,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:02,757 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:27:02,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-03-08 16:27:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202947055] [2025-03-08 16:27:02,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:02,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:02,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:02,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:27:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470096530] [2025-03-08 16:27:02,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:02,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:02,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:27:02,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:27:02,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:27:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:02,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:02,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:02,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:02,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 16:27:02,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:04,053 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-03-08 16:27:04,351 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-03-08 16:27:04,965 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 25 treesize of output 21 [2025-03-08 16:27:04,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:27:04,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:27:04,993 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-08 16:27:04,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 52 [2025-03-08 16:27:05,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:27:05,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:27:05,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:27:05,248 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2025-03-08 16:27:05,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 67 [2025-03-08 16:27:05,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 27 [2025-03-08 16:27:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 16:27:05,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:05,577 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 119 treesize of output 103 [2025-03-08 16:27:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:05,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202947055] [2025-03-08 16:27:05,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:27:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470096530] [2025-03-08 16:27:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470096530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:05,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 16:27:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986870372] [2025-03-08 16:27:05,857 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 16:27:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:27:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:27:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:27:05,858 INFO L87 Difference]: Start difference. First operand 191 states and 263 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:06,279 INFO L93 Difference]: Finished difference Result 556 states and 763 transitions. [2025-03-08 16:27:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:27:06,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-08 16:27:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:06,281 INFO L225 Difference]: With dead ends: 556 [2025-03-08 16:27:06,281 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 16:27:06,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:27:06,282 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 151 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:06,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 955 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:27:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 16:27:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 274. [2025-03-08 16:27:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 236 states have (on average 1.326271186440678) internal successors, (313), 237 states have internal predecessors, (313), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:27:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 375 transitions. [2025-03-08 16:27:06,307 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 375 transitions. Word has length 99 [2025-03-08 16:27:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 375 transitions. [2025-03-08 16:27:06,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 375 transitions. [2025-03-08 16:27:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:27:06,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:06,308 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:06,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:27:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 16:27:06,513 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:06,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1283544114, now seen corresponding path program 1 times [2025-03-08 16:27:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941582965] [2025-03-08 16:27:06,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:06,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:06,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:06,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:06,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:06,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941582965] [2025-03-08 16:27:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941582965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:06,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:06,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:27:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057631531] [2025-03-08 16:27:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:06,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:27:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:06,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:27:06,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:06,728 INFO L87 Difference]: Start difference. First operand 274 states and 375 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:06,940 INFO L93 Difference]: Finished difference Result 595 states and 809 transitions. [2025-03-08 16:27:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:27:06,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-08 16:27:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:06,942 INFO L225 Difference]: With dead ends: 595 [2025-03-08 16:27:06,944 INFO L226 Difference]: Without dead ends: 417 [2025-03-08 16:27:06,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:27:06,945 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 158 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:06,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 684 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-08 16:27:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 294. [2025-03-08 16:27:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.33203125) internal successors, (341), 257 states have internal predecessors, (341), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:27:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 403 transitions. [2025-03-08 16:27:06,969 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 403 transitions. Word has length 99 [2025-03-08 16:27:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 403 transitions. [2025-03-08 16:27:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 16:27:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 403 transitions. [2025-03-08 16:27:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:27:06,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:06,970 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:27:06,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1794078291, now seen corresponding path program 1 times [2025-03-08 16:27:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563155011] [2025-03-08 16:27:06,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:06,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:06,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563155011] [2025-03-08 16:27:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563155011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:07,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:07,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:27:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080481508] [2025-03-08 16:27:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:07,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:27:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:07,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:27:07,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:07,129 INFO L87 Difference]: Start difference. First operand 294 states and 403 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:07,254 INFO L93 Difference]: Finished difference Result 645 states and 877 transitions. [2025-03-08 16:27:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:27:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-08 16:27:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:07,257 INFO L225 Difference]: With dead ends: 645 [2025-03-08 16:27:07,257 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 16:27:07,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:27:07,257 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 126 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:07,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 483 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 16:27:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 314. [2025-03-08 16:27:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 276 states have (on average 1.3369565217391304) internal successors, (369), 277 states have internal predecessors, (369), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:27:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 431 transitions. [2025-03-08 16:27:07,291 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 431 transitions. Word has length 99 [2025-03-08 16:27:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:07,291 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 431 transitions. [2025-03-08 16:27:07,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 431 transitions. [2025-03-08 16:27:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:27:07,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:07,293 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:07,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:27:07,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:07,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash -440768594, now seen corresponding path program 1 times [2025-03-08 16:27:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205520782] [2025-03-08 16:27:07,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:07,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:07,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:07,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205520782] [2025-03-08 16:27:07,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205520782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:07,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:07,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:07,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742287333] [2025-03-08 16:27:07,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:07,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:07,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:07,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:07,414 INFO L87 Difference]: Start difference. First operand 314 states and 431 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:07,493 INFO L93 Difference]: Finished difference Result 609 states and 815 transitions. [2025-03-08 16:27:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:27:07,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-08 16:27:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:07,496 INFO L225 Difference]: With dead ends: 609 [2025-03-08 16:27:07,496 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 16:27:07,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:27:07,497 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 43 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:07,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 475 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 16:27:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 290. [2025-03-08 16:27:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 252 states have (on average 1.3055555555555556) internal successors, (329), 253 states have internal predecessors, (329), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:27:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 391 transitions. [2025-03-08 16:27:07,528 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 391 transitions. Word has length 99 [2025-03-08 16:27:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:07,528 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 391 transitions. [2025-03-08 16:27:07,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 391 transitions. [2025-03-08 16:27:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:27:07,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:07,529 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:07,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:27:07,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1500137785, now seen corresponding path program 1 times [2025-03-08 16:27:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358805370] [2025-03-08 16:27:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:07,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:27:07,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:27:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:27:07,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081196217] [2025-03-08 16:27:07,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:07,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:27:07,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:27:07,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:27:07,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:27:07,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:27:07,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:07,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:27:07,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:27:07,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:27:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:27:07,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:07,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:27:07,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:27:07,932 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:27:07,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:27:07,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:27:08,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:27:08,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:08,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:27:08,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:27:08 BoogieIcfgContainer [2025-03-08 16:27:08,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:27:08,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:27:08,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:27:08,229 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:27:08,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:56" (3/4) ... [2025-03-08 16:27:08,232 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:27:08,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:27:08,233 INFO L158 Benchmark]: Toolchain (without parser) took 12933.63ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 112.5MB in the beginning and 218.4MB in the end (delta: -105.8MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.65ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.74ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: Boogie Preprocessor took 34.17ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: IcfgBuilder took 486.99ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 60.9MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:27:08,233 INFO L158 Benchmark]: TraceAbstraction took 12121.58ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 60.5MB in the beginning and 222.5MB in the end (delta: -162.1MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. [2025-03-08 16:27:08,234 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 486.5MB. Free memory was 222.5MB in the beginning and 218.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:27:08,235 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.52ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.65ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.74ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.17ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 486.99ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 60.9MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12121.58ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 60.5MB in the beginning and 222.5MB in the end (delta: -162.1MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 486.5MB. Free memory was 222.5MB in the beginning and 218.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L35] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0][0]); [L36] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1][0]); [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer = &(signed_long_int_Array_0[0][1]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer = &(signed_long_int_Array_0[1][1]); [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L44] double last_1_double_Array_0_0_ = 0.97; [L45] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L104] EXPR double_Array_0[0] [L104] last_1_double_Array_0_0_ = double_Array_0[0] [L105] EXPR signed_long_int_Array_0[1][0] [L105] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L85] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L88] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L91] double_Array_0[1] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L93] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L94] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L96] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L97] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L97] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L97] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L99] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L49] COND FALSE !(! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) [L56] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L56] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L58] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L61] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L63] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L74] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L74] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L76] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L76] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L77] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) = (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108-L109] return ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 137 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1668 mSDsluCounter, 6173 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4518 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1619 IncrementalHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 1655 mSDtfsCounter, 1619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 571 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1242 ConstructedInterpolants, 4 QuantifiedInterpolants, 8938 SizeOfPredicates, 15 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 2728/2860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:27:08,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:27:10,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:27:10,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:27:10,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:27:10,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:27:10,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:27:10,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:27:10,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:27:10,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:27:10,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:27:10,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:27:10,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:27:10,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:27:10,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:27:10,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:27:10,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:27:10,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:27:10,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:27:10,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:27:10,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:27:10,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:27:10,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:27:10,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:27:10,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2025-03-08 16:27:10,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:27:10,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:27:10,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:27:10,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:27:10,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:27:10,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:27:11,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db7c284/1a6cd57f962349e2aa2e69af0edf704f/FLAG77bf52deb [2025-03-08 16:27:11,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:27:11,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:27:11,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db7c284/1a6cd57f962349e2aa2e69af0edf704f/FLAG77bf52deb [2025-03-08 16:27:11,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16db7c284/1a6cd57f962349e2aa2e69af0edf704f [2025-03-08 16:27:11,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:27:11,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:27:11,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:27:11,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:27:11,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:27:11,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:11" (1/1) ... [2025-03-08 16:27:11,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c46db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:11, skipping insertion in model container [2025-03-08 16:27:11,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:11" (1/1) ... [2025-03-08 16:27:11,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:27:11,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2025-03-08 16:27:12,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:27:12,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:27:12,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2025-03-08 16:27:12,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:27:12,078 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:27:12,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12 WrapperNode [2025-03-08 16:27:12,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:27:12,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:27:12,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:27:12,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:27:12,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,133 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2025-03-08 16:27:12,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:27:12,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:27:12,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:27:12,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:27:12,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,175 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-03-08 16:27:12,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:27:12,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:27:12,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:27:12,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:27:12,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (1/1) ... [2025-03-08 16:27:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:27:12,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:27:12,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:27:12,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:27:12,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:27:12,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:27:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:27:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:27:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:27:12,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:27:12,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:27:12,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:27:12,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:27:12,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:27:12,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-08 16:27:12,924 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-08 16:27:12,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:27:12,945 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:27:12,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:27:12,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:12 BoogieIcfgContainer [2025-03-08 16:27:12,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:27:12,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:27:12,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:27:12,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:27:12,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:27:11" (1/3) ... [2025-03-08 16:27:12,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcf570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:12, skipping insertion in model container [2025-03-08 16:27:12,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:12" (2/3) ... [2025-03-08 16:27:12,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcf570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:12, skipping insertion in model container [2025-03-08 16:27:12,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:12" (3/3) ... [2025-03-08 16:27:12,952 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2025-03-08 16:27:12,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:27:12,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:27:13,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:27:13,024 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;@49fce7a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:27:13,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:27:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:27:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:27:13,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:13,040 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:13,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:13,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-03-08 16:27:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:13,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168901162] [2025-03-08 16:27:13,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:13,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:13,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:13,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:13,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:27:13,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:27:13,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:27:13,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:13,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:13,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:27:13,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 16:27:13,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:13,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168901162] [2025-03-08 16:27:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168901162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:27:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54980227] [2025-03-08 16:27:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:27:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:13,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:27:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:27:13,357 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:13,379 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-03-08 16:27:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:27:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-08 16:27:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:13,385 INFO L225 Difference]: With dead ends: 163 [2025-03-08 16:27:13,385 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 16:27:13,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:27:13,389 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:13,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 16:27:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 16:27:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:27:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-08 16:27:13,417 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2025-03-08 16:27:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-08 16:27:13,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-08 16:27:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:27:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:13,423 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:13,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:27:13,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:13,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:13,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-03-08 16:27:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945122454] [2025-03-08 16:27:13,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:13,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:13,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:27:13,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:27:13,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:27:13,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:13,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:13,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:27:13,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:13,905 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 17 treesize of output 9 [2025-03-08 16:27:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:13,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:13,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945122454] [2025-03-08 16:27:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945122454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:27:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975759960] [2025-03-08 16:27:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:13,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:27:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:13,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:27:13,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:27:13,937 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:13,964 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-03-08 16:27:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:27:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-08 16:27:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:13,967 INFO L225 Difference]: With dead ends: 157 [2025-03-08 16:27:13,968 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 16:27:13,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:27:13,969 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:13,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 16:27:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 16:27:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 16:27:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-03-08 16:27:13,974 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2025-03-08 16:27:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:13,976 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-03-08 16:27:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-03-08 16:27:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:27:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:13,978 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:13,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:27:14,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:14,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-03-08 16:27:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272974063] [2025-03-08 16:27:14,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:14,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:14,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:14,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:27:14,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:27:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:27:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:14,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:27:14,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:16,276 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-03-08 16:27:16,338 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 34 treesize of output 29 [2025-03-08 16:27:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 16:27:16,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:16,578 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 34 treesize of output 30 [2025-03-08 16:27:16,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272974063] [2025-03-08 16:27:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272974063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525362354] [2025-03-08 16:27:16,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:27:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:27:16,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:27:16,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 16:27:16,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:27:17,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:27:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:17,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 16:27:17,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:18,624 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-03-08 16:27:19,290 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-03-08 16:27:19,362 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 34 treesize of output 29 [2025-03-08 16:27:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 16:27:19,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:19,512 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 34 treesize of output 30 [2025-03-08 16:27:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [525362354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:19,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:27:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-03-08 16:27:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703998248] [2025-03-08 16:27:19,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:27:19,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:27:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:27:19,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:27:19,730 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 16:27:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:21,204 INFO L93 Difference]: Finished difference Result 222 states and 309 transitions. [2025-03-08 16:27:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:27:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 94 [2025-03-08 16:27:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:21,206 INFO L225 Difference]: With dead ends: 222 [2025-03-08 16:27:21,206 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 16:27:21,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 16:27:21,207 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 853 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:21,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 748 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:27:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 16:27:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2025-03-08 16:27:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 117 states have internal predecessors, (156), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:27:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 192 transitions. [2025-03-08 16:27:21,221 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 192 transitions. Word has length 94 [2025-03-08 16:27:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:21,221 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 192 transitions. [2025-03-08 16:27:21,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 16:27:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 192 transitions. [2025-03-08 16:27:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:27:21,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:21,223 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:21,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:27:21,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 16:27:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:27:21,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-03-08 16:27:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484416650] [2025-03-08 16:27:21,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:21,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:21,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:21,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:27:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:27:21,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:27:21,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:21,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:21,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:27:21,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:21,815 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 17 treesize of output 9 [2025-03-08 16:27:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:21,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:21,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484416650] [2025-03-08 16:27:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484416650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:27:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230124625] [2025-03-08 16:27:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:27:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:27:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:27:21,825 INFO L87 Difference]: Start difference. First operand 138 states and 192 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:21,851 INFO L93 Difference]: Finished difference Result 273 states and 381 transitions. [2025-03-08 16:27:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:27:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-08 16:27:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:21,853 INFO L225 Difference]: With dead ends: 273 [2025-03-08 16:27:21,853 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 16:27:21,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:27:21,854 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:21,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 16:27:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-08 16:27:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 117 states have internal predecessors, (154), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:27:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-03-08 16:27:21,876 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 96 [2025-03-08 16:27:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:21,876 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-03-08 16:27:21,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-03-08 16:27:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:27:21,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:21,878 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:21,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:27:22,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:22,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:22,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-03-08 16:27:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542865429] [2025-03-08 16:27:22,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:22,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:27:22,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:27:22,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:27:22,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:22,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:22,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:27:22,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:22,904 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 24 treesize of output 24 [2025-03-08 16:27:23,014 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 47 treesize of output 45 [2025-03-08 16:27:23,161 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 104 treesize of output 84 [2025-03-08 16:27:23,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:27:23,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 52 [2025-03-08 16:27:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:23,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:27:23,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542865429] [2025-03-08 16:27:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542865429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:27:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512574500] [2025-03-08 16:27:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:27:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:23,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:27:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:27:23,202 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:24,954 INFO L93 Difference]: Finished difference Result 304 states and 415 transitions. [2025-03-08 16:27:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:27:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-08 16:27:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:24,956 INFO L225 Difference]: With dead ends: 304 [2025-03-08 16:27:24,956 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 16:27:24,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:27:24,957 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 234 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:24,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 755 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:27:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 16:27:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-03-08 16:27:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 139 states have internal predecessors, (178), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:27:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2025-03-08 16:27:24,972 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 96 [2025-03-08 16:27:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:24,973 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2025-03-08 16:27:24,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2025-03-08 16:27:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:27:24,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:24,974 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:24,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:27:25,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:25,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-03-08 16:27:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440811049] [2025-03-08 16:27:25,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:25,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:25,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:25,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:25,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:27:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:27:25,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:27:25,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:25,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:25,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:27:25,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 117 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 16:27:25,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:25,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440811049] [2025-03-08 16:27:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440811049] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:27:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192795520] [2025-03-08 16:27:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:25,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:25,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:27:25,610 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:25,669 INFO L93 Difference]: Finished difference Result 315 states and 422 transitions. [2025-03-08 16:27:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-08 16:27:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:25,674 INFO L225 Difference]: With dead ends: 315 [2025-03-08 16:27:25,674 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 16:27:25,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:27:25,675 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 90 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:25,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 370 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 16:27:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-03-08 16:27:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 139 states have internal predecessors, (177), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:27:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2025-03-08 16:27:25,697 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 96 [2025-03-08 16:27:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:25,697 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2025-03-08 16:27:25,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2025-03-08 16:27:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:27:25,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:25,698 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:25,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-08 16:27:25,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:25,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-03-08 16:27:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:25,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816806504] [2025-03-08 16:27:25,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:25,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:25,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:25,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-08 16:27:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:27:26,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:27:26,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:26,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:26,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:27:26,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:26,288 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 27 treesize of output 15 [2025-03-08 16:27:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 117 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 16:27:26,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:26,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:26,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816806504] [2025-03-08 16:27:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816806504] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:26,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-08 16:27:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244202312] [2025-03-08 16:27:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:26,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:26,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:27:26,369 INFO L87 Difference]: Start difference. First operand 166 states and 223 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:26,439 INFO L93 Difference]: Finished difference Result 308 states and 409 transitions. [2025-03-08 16:27:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-08 16:27:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:26,441 INFO L225 Difference]: With dead ends: 308 [2025-03-08 16:27:26,441 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 16:27:26,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:27:26,442 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:26,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:27:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 16:27:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-03-08 16:27:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.2692307692307692) internal successors, (165), 132 states have internal predecessors, (165), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:27:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2025-03-08 16:27:26,465 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 97 [2025-03-08 16:27:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:26,465 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2025-03-08 16:27:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2025-03-08 16:27:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:27:26,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:26,466 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:26,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-08 16:27:26,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:26,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-03-08 16:27:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670095266] [2025-03-08 16:27:26,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:26,669 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:26,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:27:26,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:27:26,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:27:26,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:26,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:26,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:27:26,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:27,516 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 17 treesize of output 17 [2025-03-08 16:27:27,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:27:27,614 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 1 case distinctions, treesize of input 54 treesize of output 30 [2025-03-08 16:27:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 16:27:27,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:27:27,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670095266] [2025-03-08 16:27:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670095266] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:27:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-08 16:27:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141736843] [2025-03-08 16:27:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:27,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:27:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:27:27,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:27:27,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:27:27,706 INFO L87 Difference]: Start difference. First operand 159 states and 211 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:27,877 INFO L93 Difference]: Finished difference Result 438 states and 577 transitions. [2025-03-08 16:27:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:27:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2025-03-08 16:27:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:27,885 INFO L225 Difference]: With dead ends: 438 [2025-03-08 16:27:27,885 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 16:27:27,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:27:27,887 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 87 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:27,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 655 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 16:27:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2025-03-08 16:27:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 245 states have (on average 1.2693877551020407) internal successors, (311), 249 states have internal predecessors, (311), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:27:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 389 transitions. [2025-03-08 16:27:27,921 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 389 transitions. Word has length 98 [2025-03-08 16:27:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:27,921 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 389 transitions. [2025-03-08 16:27:27,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 16:27:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 389 transitions. [2025-03-08 16:27:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:27:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:27,922 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:27,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 16:27:28,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:28,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:28,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-03-08 16:27:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:27:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040870151] [2025-03-08 16:27:28,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:27:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:27:28,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:27:28,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-08 16:27:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:28,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:28,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:28,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:27:28,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:28,597 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 7 treesize of output 3 [2025-03-08 16:27:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2025-03-08 16:27:31,922 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 37 treesize of output 24 [2025-03-08 16:27:32,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:27:32,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 44 [2025-03-08 16:27:32,379 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 59 treesize of output 49 [2025-03-08 16:27:32,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:27:32,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 37 [2025-03-08 16:27:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 16:27:32,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:44,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:27:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040870151] [2025-03-08 16:27:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040870151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:27:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [895630035] [2025-03-08 16:27:44,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:44,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:27:44,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:27:44,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:27:44,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-08 16:27:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:27:45,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:27:45,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:45,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 16:27:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:27:48,630 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-03-08 16:27:49,405 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-03-08 16:27:52,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2025-03-08 16:27:52,411 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 26 treesize of output 22 [2025-03-08 16:27:52,419 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 44 treesize of output 38 [2025-03-08 16:27:53,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2025-03-08 16:27:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 16:27:53,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:27:53,613 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 60 treesize of output 52 [2025-03-08 16:28:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [895630035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:28:24,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:28:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2025-03-08 16:28:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538090344] [2025-03-08 16:28:24,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:28:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 16:28:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:28:24,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 16:28:24,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1434, Unknown=7, NotChecked=0, Total=1640 [2025-03-08 16:28:24,773 INFO L87 Difference]: Start difference. First operand 295 states and 389 transitions. Second operand has 29 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 26 states have internal predecessors, (102), 7 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22)