./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0ae61b06b0aba3d06f86b093a26fd41b42a2d6ddf8b91f025323a6d77539796 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:31:28,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:31:28,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:31:28,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:31:28,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:31:28,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:31:28,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:31:28,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:31:28,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:31:28,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:31:28,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:31:28,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:31:28,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:31:28,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:31:28,609 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:31:28,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:31:28,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:31:28,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:28,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:31:28,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:31:28,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:28,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:31:28,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:31:28,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:31:28,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:31:28,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:31:28,614 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0ae61b06b0aba3d06f86b093a26fd41b42a2d6ddf8b91f025323a6d77539796 [2025-01-09 15:31:28,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:31:28,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:31:28,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:31:28,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:31:28,865 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:31:28,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:30,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3279db22/a527574ca05249d887228051887670ea/FLAG4fa996e24 [2025-01-09 15:31:30,303 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:31:30,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:30,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3279db22/a527574ca05249d887228051887670ea/FLAG4fa996e24 [2025-01-09 15:31:30,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3279db22/a527574ca05249d887228051887670ea [2025-01-09 15:31:30,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:31:30,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:31:30,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:31:30,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:31:30,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:31:30,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c94f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30, skipping insertion in model container [2025-01-09 15:31:30,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:31:30,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i[917,930] [2025-01-09 15:31:30,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:31:30,524 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:31:30,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i[917,930] [2025-01-09 15:31:30,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:31:30,582 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:31:30,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30 WrapperNode [2025-01-09 15:31:30,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:31:30,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:31:30,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:31:30,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:31:30,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,635 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-01-09 15:31:30,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:31:30,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:31:30,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:31:30,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:31:30,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,671 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2025-01-09 15:31:30,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:31:30,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:31:30,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:31:30,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:31:30,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (1/1) ... [2025-01-09 15:31:30,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:30,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:31:30,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:31:30,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:31:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:31:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:31:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:31:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:31:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:31:30,878 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:31:30,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:31:31,166 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 15:31:31,166 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:31:31,173 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:31:31,173 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:31:31,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:31 BoogieIcfgContainer [2025-01-09 15:31:31,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:31:31,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:31:31,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:31:31,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:31:31,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:31:30" (1/3) ... [2025-01-09 15:31:31,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271c5c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:31, skipping insertion in model container [2025-01-09 15:31:31,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:30" (2/3) ... [2025-01-09 15:31:31,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271c5c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:31, skipping insertion in model container [2025-01-09 15:31:31,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:31" (3/3) ... [2025-01-09 15:31:31,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:31,189 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:31:31,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:31:31,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:31:31,230 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;@2cc0df8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:31:31,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:31:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:31,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:31,240 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:31,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:31,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash -635571940, now seen corresponding path program 1 times [2025-01-09 15:31:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644155583] [2025-01-09 15:31:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:31,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:31:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644155583] [2025-01-09 15:31:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644155583] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:31:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357074834] [2025-01-09 15:31:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:31,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:31:31,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:31:31,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:31:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:31:31,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:31,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:31,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:31,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:31:31,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:31:31,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357074834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:31:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:31:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102265877] [2025-01-09 15:31:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:31:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:31,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:31:31,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:31,632 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:31,650 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:31:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:31:31,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:31:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:31,655 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:31:31,656 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:31:31,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:31,659 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:31,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:31:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:31:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-01-09 15:31:31,682 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-01-09 15:31:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-01-09 15:31:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-01-09 15:31:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:31,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:31,684 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:31,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:31:31,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:31:31,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 499056734, now seen corresponding path program 1 times [2025-01-09 15:31:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600635497] [2025-01-09 15:31:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:31,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:31,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:31,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:31,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:32,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600635497] [2025-01-09 15:31:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600635497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:31:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564831425] [2025-01-09 15:31:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:31:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:32,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:31:32,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:32,144 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:32,180 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-01-09 15:31:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:31:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:31:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:32,182 INFO L225 Difference]: With dead ends: 183 [2025-01-09 15:31:32,182 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:31:32,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:32,183 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:32,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:31:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 15:31:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-01-09 15:31:32,189 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2025-01-09 15:31:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-01-09 15:31:32,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-01-09 15:31:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:32,191 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:31:32,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -376962272, now seen corresponding path program 1 times [2025-01-09 15:31:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292756882] [2025-01-09 15:31:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:32,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:32,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:32,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:32,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292756882] [2025-01-09 15:31:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292756882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:31:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943807307] [2025-01-09 15:31:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:32,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:31:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:32,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:31:32,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:31:32,768 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:32,946 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2025-01-09 15:31:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:31:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:31:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:32,949 INFO L225 Difference]: With dead ends: 307 [2025-01-09 15:31:32,951 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 15:31:32,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:32,952 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 394 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:32,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 694 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 15:31:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-01-09 15:31:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:31:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2025-01-09 15:31:32,962 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2025-01-09 15:31:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:32,963 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2025-01-09 15:31:32,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2025-01-09 15:31:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 15:31:32,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:32,964 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:32,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:31:32,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:32,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 815085442, now seen corresponding path program 1 times [2025-01-09 15:31:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774985637] [2025-01-09 15:31:32,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:32,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 15:31:32,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 15:31:32,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:32,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774985637] [2025-01-09 15:31:33,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774985637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:33,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:33,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:31:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298927933] [2025-01-09 15:31:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:31:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:33,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:31:33,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:31:33,123 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:33,188 INFO L93 Difference]: Finished difference Result 378 states and 549 transitions. [2025-01-09 15:31:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:31:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2025-01-09 15:31:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:33,189 INFO L225 Difference]: With dead ends: 378 [2025-01-09 15:31:33,191 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 15:31:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:33,193 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:33,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 501 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 15:31:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-09 15:31:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:31:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2025-01-09 15:31:33,211 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 83 [2025-01-09 15:31:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:33,211 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2025-01-09 15:31:33,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2025-01-09 15:31:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 15:31:33,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:33,215 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:33,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:31:33,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1446331243, now seen corresponding path program 1 times [2025-01-09 15:31:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062051344] [2025-01-09 15:31:33,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 15:31:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 15:31:33,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062051344] [2025-01-09 15:31:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062051344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:31:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518102276] [2025-01-09 15:31:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:31:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:34,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:31:34,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:31:34,102 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:34,470 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2025-01-09 15:31:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:31:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2025-01-09 15:31:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:34,472 INFO L225 Difference]: With dead ends: 490 [2025-01-09 15:31:34,472 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 15:31:34,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:31:34,473 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 457 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:34,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 970 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:31:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 15:31:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 227. [2025-01-09 15:31:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 210 states have internal predecessors, (295), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:31:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2025-01-09 15:31:34,486 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 87 [2025-01-09 15:31:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:34,486 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2025-01-09 15:31:34,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2025-01-09 15:31:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 15:31:34,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:34,487 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:34,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:31:34,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:34,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1991794444, now seen corresponding path program 1 times [2025-01-09 15:31:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590455445] [2025-01-09 15:31:34,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:34,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 15:31:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 15:31:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590455445] [2025-01-09 15:31:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590455445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:31:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222706282] [2025-01-09 15:31:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:31:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:35,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:31:35,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:31:35,075 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:35,288 INFO L93 Difference]: Finished difference Result 431 states and 608 transitions. [2025-01-09 15:31:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:31:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2025-01-09 15:31:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:35,290 INFO L225 Difference]: With dead ends: 431 [2025-01-09 15:31:35,290 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 15:31:35,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:31:35,291 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 207 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:35,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 700 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 15:31:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 230. [2025-01-09 15:31:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 213 states have internal predecessors, (298), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:31:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 326 transitions. [2025-01-09 15:31:35,303 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 326 transitions. Word has length 88 [2025-01-09 15:31:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 326 transitions. [2025-01-09 15:31:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 326 transitions. [2025-01-09 15:31:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:31:35,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:35,304 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:35,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:31:35,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:35,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash -760288170, now seen corresponding path program 1 times [2025-01-09 15:31:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:35,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418316408] [2025-01-09 15:31:35,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:35,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:31:35,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:31:35,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:35,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418316408] [2025-01-09 15:31:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418316408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:31:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923626881] [2025-01-09 15:31:35,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:31:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:35,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:31:35,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:35,489 INFO L87 Difference]: Start difference. First operand 230 states and 326 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:35,586 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2025-01-09 15:31:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:31:35,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-01-09 15:31:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:35,588 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:31:35,588 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 15:31:35,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:31:35,589 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 135 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:35,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 867 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 15:31:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-01-09 15:31:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 221 states have internal predecessors, (306), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:31:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2025-01-09 15:31:35,599 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 89 [2025-01-09 15:31:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:35,599 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2025-01-09 15:31:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2025-01-09 15:31:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:31:35,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:35,600 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:35,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:31:35,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1161703013, now seen corresponding path program 1 times [2025-01-09 15:31:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867590787] [2025-01-09 15:31:35,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:35,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:31:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:31:35,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:35,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867590787] [2025-01-09 15:31:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867590787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:35,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:31:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223792162] [2025-01-09 15:31:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:31:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:35,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:31:35,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:31:35,771 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:35,883 INFO L93 Difference]: Finished difference Result 756 states and 1061 transitions. [2025-01-09 15:31:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:31:35,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-01-09 15:31:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:35,886 INFO L225 Difference]: With dead ends: 756 [2025-01-09 15:31:35,886 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 15:31:35,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:31:35,887 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 234 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:35,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 719 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 15:31:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 436. [2025-01-09 15:31:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 403 states have (on average 1.3771712158808933) internal successors, (555), 403 states have internal predecessors, (555), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:31:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 611 transitions. [2025-01-09 15:31:35,905 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 611 transitions. Word has length 89 [2025-01-09 15:31:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 611 transitions. [2025-01-09 15:31:35,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 611 transitions. [2025-01-09 15:31:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:31:35,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:35,907 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:31:35,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:35,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -832441693, now seen corresponding path program 1 times [2025-01-09 15:31:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534059291] [2025-01-09 15:31:35,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:35,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:31:35,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:31:35,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:35,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534059291] [2025-01-09 15:31:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534059291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:31:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974006139] [2025-01-09 15:31:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:31:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:36,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:31:36,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:31:36,239 INFO L87 Difference]: Start difference. First operand 436 states and 611 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:36,513 INFO L93 Difference]: Finished difference Result 1015 states and 1407 transitions. [2025-01-09 15:31:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:31:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-01-09 15:31:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:36,517 INFO L225 Difference]: With dead ends: 1015 [2025-01-09 15:31:36,517 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 15:31:36,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:31:36,518 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 482 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:36,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1158 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:31:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 15:31:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 462. [2025-01-09 15:31:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 429 states have (on average 1.372960372960373) internal successors, (589), 429 states have internal predecessors, (589), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:31:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 645 transitions. [2025-01-09 15:31:36,539 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 645 transitions. Word has length 89 [2025-01-09 15:31:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:36,539 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 645 transitions. [2025-01-09 15:31:36,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 645 transitions. [2025-01-09 15:31:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:31:36,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:36,540 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:36,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:31:36,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2070830630, now seen corresponding path program 1 times [2025-01-09 15:31:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705827591] [2025-01-09 15:31:36,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:36,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:31:36,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:31:36,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705827591] [2025-01-09 15:31:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705827591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:31:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151165209] [2025-01-09 15:31:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:36,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:31:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:36,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:31:36,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:31:36,708 INFO L87 Difference]: Start difference. First operand 462 states and 645 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:36,834 INFO L93 Difference]: Finished difference Result 1001 states and 1389 transitions. [2025-01-09 15:31:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:31:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-01-09 15:31:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:36,837 INFO L225 Difference]: With dead ends: 1001 [2025-01-09 15:31:36,837 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 15:31:36,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:36,838 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 302 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:36,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 587 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 15:31:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 492. [2025-01-09 15:31:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 459 states have (on average 1.3572984749455337) internal successors, (623), 459 states have internal predecessors, (623), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:31:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 679 transitions. [2025-01-09 15:31:36,872 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 679 transitions. Word has length 90 [2025-01-09 15:31:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 679 transitions. [2025-01-09 15:31:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 679 transitions. [2025-01-09 15:31:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:31:36,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:36,874 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:36,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:31:36,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:36,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1937105306, now seen corresponding path program 1 times [2025-01-09 15:31:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626345726] [2025-01-09 15:31:36,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:36,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:31:36,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:31:36,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:36,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:31:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626345726] [2025-01-09 15:31:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626345726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:31:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795701816] [2025-01-09 15:31:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:36,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:31:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:31:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:31:36,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:31:36,975 INFO L87 Difference]: Start difference. First operand 492 states and 679 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:31:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:37,037 INFO L93 Difference]: Finished difference Result 992 states and 1369 transitions. [2025-01-09 15:31:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:31:37,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 15:31:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:37,039 INFO L225 Difference]: With dead ends: 992 [2025-01-09 15:31:37,039 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 15:31:37,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:31:37,041 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:37,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 15:31:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 491. [2025-01-09 15:31:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 458 states have (on average 1.3558951965065502) internal successors, (621), 458 states have internal predecessors, (621), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:31:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 677 transitions. [2025-01-09 15:31:37,059 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 677 transitions. Word has length 90 [2025-01-09 15:31:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:37,059 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 677 transitions. [2025-01-09 15:31:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:31:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 677 transitions. [2025-01-09 15:31:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:31:37,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:37,069 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:37,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:31:37,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:37,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash -628315644, now seen corresponding path program 1 times [2025-01-09 15:31:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:31:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358921234] [2025-01-09 15:31:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:31:37,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:31:37,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:31:37,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:37,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:31:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945031250] [2025-01-09 15:31:37,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:31:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:31:37,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:31:37,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:31:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:31:37,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:31:37,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:37,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:31:37,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:31:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:31:37,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:31:37,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:37,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:31:37,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:31:37,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:31:37,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:31:37,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:31:37,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:31:37,565 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:37,649 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:31:37,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:31:37 BoogieIcfgContainer [2025-01-09 15:31:37,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:31:37,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:31:37,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:31:37,655 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:31:37,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:31" (3/4) ... [2025-01-09 15:31:37,657 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:31:37,657 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:31:37,658 INFO L158 Benchmark]: Toolchain (without parser) took 7330.33ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 111.1MB in the beginning and 198.4MB in the end (delta: -87.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-01-09 15:31:37,660 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:31:37,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.74ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 96.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:31:37,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.90ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 93.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:31:37,660 INFO L158 Benchmark]: Boogie Preprocessor took 71.64ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:31:37,661 INFO L158 Benchmark]: RCFGBuilder took 465.85ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 60.3MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:31:37,661 INFO L158 Benchmark]: TraceAbstraction took 6476.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 59.8MB in the beginning and 198.4MB in the end (delta: -138.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-01-09 15:31:37,661 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 285.2MB. Free memory was 198.4MB in the beginning and 198.4MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:31:37,662 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.74ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 96.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.90ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 93.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.64ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 465.85ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 60.3MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6476.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 59.8MB in the beginning and 198.4MB in the end (delta: -138.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 285.2MB. Free memory was 198.4MB in the beginning and 198.4MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 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[3] = { 15.4, 15.6, 32.2 }; [L27-L29] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L27-L29] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L27-L29] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [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] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33-L35] float float_Array_0[2] = { 5.75, 8.6 }; [L33-L35] float float_Array_0[2] = { 5.75, 8.6 }; [L33-L35] float float_Array_0[2] = { 5.75, 8.6 }; [L36] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L37] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L38-L40] signed short int signed_short_int_Array_0[1] = { 256 }; [L38-L40] signed short int signed_short_int_Array_0[1] = { 256 }; [L41] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L42-L44] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L42-L44] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L45] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L46] unsigned char last_1_BOOL_unsigned_char_Array_0_1_ = 0; [L47] signed short int last_1_signed_short_int_Array_0_0_ = 256; 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L99] isInitial = 1 [L100] FCALL initially() [L102] CALL updateLastVariables() [L91] EXPR BOOL_unsigned_char_Array_0[1] [L91] last_1_BOOL_unsigned_char_Array_0_1_ = BOOL_unsigned_char_Array_0[1] [L92] EXPR signed_short_int_Array_0[0] [L92] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L77] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L77] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L78] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L78] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L78] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L79] double_Array_0[0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L80] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L80] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L80] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L80] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L82] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L83] double_Array_0[2] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L84] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L84] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L84] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L84] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L85] float_Array_0[0] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[0] [L86] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L86] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L86] EXPR float_Array_0[0] [L86] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L86] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L86] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L87] float_Array_0[1] = __VERIFIER_nondet_float() [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L88] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L88] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L103] RET updateVariables() [L104] CALL step() [L51] COND TRUE (last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L52] COND FALSE !(last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L61] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L61] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L61] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L61] COND FALSE !(((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) >= (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) [L64] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L64] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L67] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L67] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L67] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) [L67] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L67] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L67] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L67] COND TRUE (((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) [L68] last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L68] last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L68] COND FALSE !(last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 [L95] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) [L95] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L95] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) [L95] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L95] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) [L95] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L95] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L95] EXPR ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) >= (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) >= (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [L95-L96] return ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && (((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) <= (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0)) : 1) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) >= (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : 1) ; [L105] RET, EXPR property() [L105] 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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] [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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2343 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2343 mSDsluCounter, 7604 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6052 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 1552 mSDtfsCounter, 926 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 452 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 4266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 996/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:31:37,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0ae61b06b0aba3d06f86b093a26fd41b42a2d6ddf8b91f025323a6d77539796 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:31:39,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:31:39,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:31:39,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:31:39,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:31:39,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:31:39,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:31:39,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:31:39,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:31:39,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:31:39,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:31:39,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:31:39,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:31:39,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:39,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:31:39,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:31:39,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:31:39,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:39,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:31:39,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:31:39,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:31:39,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0ae61b06b0aba3d06f86b093a26fd41b42a2d6ddf8b91f025323a6d77539796 [2025-01-09 15:31:40,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:31:40,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:31:40,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:31:40,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:31:40,041 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:31:40,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:41,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cb73fc41/376a7b3cab54498c965b7bd1da169a6e/FLAG399f22f1e [2025-01-09 15:31:41,511 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:31:41,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:41,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cb73fc41/376a7b3cab54498c965b7bd1da169a6e/FLAG399f22f1e [2025-01-09 15:31:41,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cb73fc41/376a7b3cab54498c965b7bd1da169a6e [2025-01-09 15:31:41,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:31:41,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:31:41,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:31:41,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:31:41,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:31:41,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148be5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41, skipping insertion in model container [2025-01-09 15:31:41,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:31:41,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i[917,930] [2025-01-09 15:31:41,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:31:41,723 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:31:41,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i[917,930] [2025-01-09 15:31:41,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:31:41,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:31:41,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41 WrapperNode [2025-01-09 15:31:41,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:31:41,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:31:41,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:31:41,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:31:41,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,801 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-01-09 15:31:41,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:31:41,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:31:41,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:31:41,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:31:41,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,848 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2025-01-09 15:31:41,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:31:41,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:31:41,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:31:41,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:31:41,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (1/1) ... [2025-01-09 15:31:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:31:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:31:41,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:31:41,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:31:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:31:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:31:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:31:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:31:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:31:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:31:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:31:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:31:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:31:42,109 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:31:42,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:31:53,175 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-01-09 15:31:53,175 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:31:53,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:31:53,182 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:31:53,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:53 BoogieIcfgContainer [2025-01-09 15:31:53,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:31:53,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:31:53,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:31:53,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:31:53,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:31:41" (1/3) ... [2025-01-09 15:31:53,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540d1eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:53, skipping insertion in model container [2025-01-09 15:31:53,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:31:41" (2/3) ... [2025-01-09 15:31:53,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540d1eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:53, skipping insertion in model container [2025-01-09 15:31:53,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:53" (3/3) ... [2025-01-09 15:31:53,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-21.i [2025-01-09 15:31:53,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:31:53,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:31:53,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:31:53,240 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;@7ff10580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:31:53,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:31:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:53,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:53,248 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:53,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:53,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash -635571940, now seen corresponding path program 1 times [2025-01-09 15:31:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:53,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143193141] [2025-01-09 15:31:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:53,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:53,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:31:53,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:31:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:53,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:53,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:31:53,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:31:53,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:53,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143193141] [2025-01-09 15:31:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143193141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:31:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119517195] [2025-01-09 15:31:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:31:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:53,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:31:53,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:53,602 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:53,617 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:31:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:31:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:31:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:53,622 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:31:53,622 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:31:53,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:53,626 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:53,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:31:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:31:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-01-09 15:31:53,651 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-01-09 15:31:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:53,651 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-01-09 15:31:53,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-01-09 15:31:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:53,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:53,654 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:53,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:31:53,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:53,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:53,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 499056734, now seen corresponding path program 1 times [2025-01-09 15:31:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526318875] [2025-01-09 15:31:53,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:53,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:31:53,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:31:53,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:54,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:54,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:31:54,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 15:31:54,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:54,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526318875] [2025-01-09 15:31:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526318875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:31:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572838617] [2025-01-09 15:31:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:31:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:54,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:31:54,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:54,177 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:54,249 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-01-09 15:31:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:31:54,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-01-09 15:31:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:54,250 INFO L225 Difference]: With dead ends: 183 [2025-01-09 15:31:54,250 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:31:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:54,251 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:54,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:31:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 15:31:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 15:31:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-01-09 15:31:54,266 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2025-01-09 15:31:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:54,267 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-01-09 15:31:54,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:31:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-01-09 15:31:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:31:54,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:54,270 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:31:54,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:31:54,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:54,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:54,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash -376962272, now seen corresponding path program 1 times [2025-01-09 15:31:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:54,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532471087] [2025-01-09 15:31:54,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:54,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:54,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:31:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:31:54,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:31:54,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:31:54,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:54,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:54,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:31:54,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:54,783 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-01-09 15:31:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:31:55,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:55,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532471087] [2025-01-09 15:31:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532471087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:55,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:55,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:31:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959723484] [2025-01-09 15:31:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:55,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:31:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:55,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:31:55,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:55,046 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:31:58,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:01,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:04,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:07,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:09,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:10,063 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2025-01-09 15:32:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:32:10,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-01-09 15:32:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:10,067 INFO L225 Difference]: With dead ends: 307 [2025-01-09 15:32:10,067 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 15:32:10,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:10,068 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 236 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:10,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 370 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2025-01-09 15:32:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 15:32:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-01-09 15:32:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2025-01-09 15:32:10,088 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2025-01-09 15:32:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:10,092 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2025-01-09 15:32:10,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2025-01-09 15:32:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 15:32:10,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:10,093 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:10,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:32:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:10,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:10,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash 815085442, now seen corresponding path program 1 times [2025-01-09 15:32:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328822900] [2025-01-09 15:32:10,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:10,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:10,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:10,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:32:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 15:32:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 15:32:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:10,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:10,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:32:10,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:11,093 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-01-09 15:32:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:32:11,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:11,566 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:32:11,566 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 30 treesize of output 25 [2025-01-09 15:32:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 15:32:11,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328822900] [2025-01-09 15:32:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328822900] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:32:11,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:32:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 15:32:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034075172] [2025-01-09 15:32:11,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:32:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:32:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:11,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:32:11,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:32:11,592 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 21 states, 17 states have (on average 5.529411764705882) internal successors, (94), 19 states have internal predecessors, (94), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:32:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:12,459 INFO L93 Difference]: Finished difference Result 394 states and 558 transitions. [2025-01-09 15:32:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:32:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.529411764705882) internal successors, (94), 19 states have internal predecessors, (94), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 83 [2025-01-09 15:32:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:12,463 INFO L225 Difference]: With dead ends: 394 [2025-01-09 15:32:12,463 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 15:32:12,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:32:12,466 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 246 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:12,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1050 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:32:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 15:32:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2025-01-09 15:32:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2025-01-09 15:32:12,488 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 83 [2025-01-09 15:32:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:12,488 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2025-01-09 15:32:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.529411764705882) internal successors, (94), 19 states have internal predecessors, (94), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:32:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2025-01-09 15:32:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:32:12,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:12,490 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:12,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:12,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:12,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:12,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 57756579, now seen corresponding path program 1 times [2025-01-09 15:32:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860389998] [2025-01-09 15:32:12,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:12,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:12,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:32:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:32:13,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:32:13,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:13,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:13,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:32:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:13,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:13,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860389998] [2025-01-09 15:32:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860389998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:32:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534498969] [2025-01-09 15:32:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:13,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:32:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:13,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:32:13,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:13,147 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:13,276 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2025-01-09 15:32:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:32:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2025-01-09 15:32:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:13,277 INFO L225 Difference]: With dead ends: 276 [2025-01-09 15:32:13,277 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 15:32:13,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:13,278 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:13,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:32:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 15:32:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-01-09 15:32:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 156 states have internal predecessors, (214), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2025-01-09 15:32:13,296 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 84 [2025-01-09 15:32:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:13,297 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2025-01-09 15:32:13,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2025-01-09 15:32:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 15:32:13,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:13,298 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:13,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:32:13,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:13,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1991794444, now seen corresponding path program 1 times [2025-01-09 15:32:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317531489] [2025-01-09 15:32:13,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:13,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:13,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:32:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 15:32:13,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 15:32:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:13,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:13,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:32:13,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:14,146 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 77 treesize of output 41 [2025-01-09 15:32:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 15:32:14,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:14,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317531489] [2025-01-09 15:32:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317531489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:14,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:32:14,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120468724] [2025-01-09 15:32:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:14,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:32:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:14,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:32:14,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:32:14,184 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:32:16,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:18,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:21,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:24,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:24,581 INFO L93 Difference]: Finished difference Result 311 states and 426 transitions. [2025-01-09 15:32:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:32:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2025-01-09 15:32:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:24,602 INFO L225 Difference]: With dead ends: 311 [2025-01-09 15:32:24,602 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 15:32:24,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:32:24,603 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:24,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 15:32:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 15:32:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-01-09 15:32:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.358974358974359) internal successors, (212), 156 states have internal predecessors, (212), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2025-01-09 15:32:24,611 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 88 [2025-01-09 15:32:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:24,612 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2025-01-09 15:32:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:32:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2025-01-09 15:32:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 15:32:24,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:24,612 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:24,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:32:24,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:24,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:24,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1663420186, now seen corresponding path program 1 times [2025-01-09 15:32:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811595521] [2025-01-09 15:32:24,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:24,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:24,820 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:24,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:32:24,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 15:32:25,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 15:32:25,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:25,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:32:25,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:25,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 15:32:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:25,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:25,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811595521] [2025-01-09 15:32:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811595521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:32:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192409969] [2025-01-09 15:32:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:25,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:32:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:32:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:32:25,405 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:32:27,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:31,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:33,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:37,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:32:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:37,926 INFO L93 Difference]: Finished difference Result 304 states and 412 transitions. [2025-01-09 15:32:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:32:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-01-09 15:32:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:37,949 INFO L225 Difference]: With dead ends: 304 [2025-01-09 15:32:37,949 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 15:32:37,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:32:37,949 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:37,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 402 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2025-01-09 15:32:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 15:32:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-01-09 15:32:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 states have internal predecessors, (210), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 238 transitions. [2025-01-09 15:32:37,959 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 238 transitions. Word has length 90 [2025-01-09 15:32:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:37,960 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 238 transitions. [2025-01-09 15:32:37,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 15:32:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 238 transitions. [2025-01-09 15:32:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:32:37,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:37,961 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:37,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:32:38,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:38,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:38,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1037284276, now seen corresponding path program 1 times [2025-01-09 15:32:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989469147] [2025-01-09 15:32:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:38,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:38,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:32:38,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:32:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:32:38,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:38,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:32:38,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:40,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-01-09 15:32:40,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:40,383 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 72 treesize of output 40 [2025-01-09 15:32:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:32:40,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:40,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989469147] [2025-01-09 15:32:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989469147] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:32:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-01-09 15:32:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249967559] [2025-01-09 15:32:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:32:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:32:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:32:40,836 INFO L87 Difference]: Start difference. First operand 177 states and 238 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:41,074 INFO L93 Difference]: Finished difference Result 319 states and 431 transitions. [2025-01-09 15:32:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:32:41,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 92 [2025-01-09 15:32:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:41,077 INFO L225 Difference]: With dead ends: 319 [2025-01-09 15:32:41,077 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 15:32:41,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:32:41,078 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 618 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:32:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 15:32:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2025-01-09 15:32:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 176 states have internal predecessors, (236), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2025-01-09 15:32:41,092 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 92 [2025-01-09 15:32:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:41,093 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2025-01-09 15:32:41,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2025-01-09 15:32:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:41,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:41,097 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:41,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:41,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:41,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:41,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash 487014647, now seen corresponding path program 1 times [2025-01-09 15:32:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075116261] [2025-01-09 15:32:41,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:41,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:41,301 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:41,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:32:41,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:41,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:41,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:41,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:32:41,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:42,238 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2025-01-09 15:32:42,239 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 1 case distinctions, treesize of input 36 treesize of output 35 [2025-01-09 15:32:42,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:42,617 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 40 treesize of output 32 [2025-01-09 15:32:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:32:42,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:43,327 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:32:43,328 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 30 treesize of output 25 [2025-01-09 15:32:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 15:32:43,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075116261] [2025-01-09 15:32:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075116261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:32:43,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:32:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2025-01-09 15:32:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50329433] [2025-01-09 15:32:43,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:32:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 15:32:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 15:32:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:32:43,360 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand has 29 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:32:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:45,231 INFO L93 Difference]: Finished difference Result 390 states and 523 transitions. [2025-01-09 15:32:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:32:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2025-01-09 15:32:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:45,234 INFO L225 Difference]: With dead ends: 390 [2025-01-09 15:32:45,234 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 15:32:45,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=531, Invalid=1539, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 15:32:45,237 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 483 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:45,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1889 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:32:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 15:32:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 221. [2025-01-09 15:32:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:32:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 297 transitions. [2025-01-09 15:32:45,253 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 297 transitions. Word has length 94 [2025-01-09 15:32:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:45,253 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 297 transitions. [2025-01-09 15:32:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:32:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 297 transitions. [2025-01-09 15:32:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:45,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:45,257 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:45,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:45,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:45,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash -297613564, now seen corresponding path program 1 times [2025-01-09 15:32:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708426397] [2025-01-09 15:32:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:45,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:45,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:45,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:32:45,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:45,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:45,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:45,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:45,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:32:45,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:45,835 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 21 treesize of output 9 [2025-01-09 15:32:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:45,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:45,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708426397] [2025-01-09 15:32:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708426397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:32:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374022357] [2025-01-09 15:32:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:32:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:45,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:32:45,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:45,973 INFO L87 Difference]: Start difference. First operand 221 states and 297 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:46,110 INFO L93 Difference]: Finished difference Result 504 states and 683 transitions. [2025-01-09 15:32:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:32:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-01-09 15:32:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:46,112 INFO L225 Difference]: With dead ends: 504 [2025-01-09 15:32:46,112 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 15:32:46,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:32:46,113 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 192 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:46,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 544 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:32:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 15:32:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 319. [2025-01-09 15:32:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 288 states have (on average 1.34375) internal successors, (387), 288 states have internal predecessors, (387), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 429 transitions. [2025-01-09 15:32:46,135 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 429 transitions. Word has length 94 [2025-01-09 15:32:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:46,136 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 429 transitions. [2025-01-09 15:32:46,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2025-01-09 15:32:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:46,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:46,136 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:46,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:46,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 414861124, now seen corresponding path program 1 times [2025-01-09 15:32:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749816340] [2025-01-09 15:32:46,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:46,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:46,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:46,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:32:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:46,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:46,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:46,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:46,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:32:46,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:47,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:47,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 125 [2025-01-09 15:32:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:47,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:47,868 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749816340] [2025-01-09 15:32:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749816340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:47,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:32:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813474853] [2025-01-09 15:32:47,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:47,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:32:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:47,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:32:47,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:32:47,870 INFO L87 Difference]: Start difference. First operand 319 states and 429 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:50,606 INFO L93 Difference]: Finished difference Result 693 states and 933 transitions. [2025-01-09 15:32:50,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:32:50,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-01-09 15:32:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:50,610 INFO L225 Difference]: With dead ends: 693 [2025-01-09 15:32:50,610 INFO L226 Difference]: Without dead ends: 452 [2025-01-09 15:32:50,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:32:50,611 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 52 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:50,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 779 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 15:32:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-09 15:32:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 377. [2025-01-09 15:32:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 346 states have internal predecessors, (465), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 507 transitions. [2025-01-09 15:32:50,650 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 507 transitions. Word has length 94 [2025-01-09 15:32:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:50,650 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 507 transitions. [2025-01-09 15:32:50,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 507 transitions. [2025-01-09 15:32:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:50,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:50,651 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:50,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:32:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:50,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 21834114, now seen corresponding path program 1 times [2025-01-09 15:32:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153884444] [2025-01-09 15:32:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:50,863 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:50,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:32:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:51,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:51,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:32:51,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:51,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:51,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153884444] [2025-01-09 15:32:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153884444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:32:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290277369] [2025-01-09 15:32:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:32:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:51,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:32:51,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:32:51,915 INFO L87 Difference]: Start difference. First operand 377 states and 507 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:53,432 INFO L93 Difference]: Finished difference Result 738 states and 991 transitions. [2025-01-09 15:32:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:32:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-01-09 15:32:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:53,440 INFO L225 Difference]: With dead ends: 738 [2025-01-09 15:32:53,441 INFO L226 Difference]: Without dead ends: 446 [2025-01-09 15:32:53,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:32:53,442 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 46 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:53,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 712 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:32:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-09 15:32:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 377. [2025-01-09 15:32:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 346 states have internal predecessors, (462), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 504 transitions. [2025-01-09 15:32:53,460 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 504 transitions. Word has length 94 [2025-01-09 15:32:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:53,460 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 504 transitions. [2025-01-09 15:32:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 504 transitions. [2025-01-09 15:32:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:53,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:53,461 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:53,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:53,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash 837562950, now seen corresponding path program 1 times [2025-01-09 15:32:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57693537] [2025-01-09 15:32:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:53,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:53,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:53,668 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:53,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:32:53,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:54,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:54,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:54,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:54,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:32:54,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:54,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:54,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 111 [2025-01-09 15:32:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:54,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:54,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57693537] [2025-01-09 15:32:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57693537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:32:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236331101] [2025-01-09 15:32:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:32:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:32:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:54,523 INFO L87 Difference]: Start difference. First operand 377 states and 504 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:55,285 INFO L93 Difference]: Finished difference Result 758 states and 1011 transitions. [2025-01-09 15:32:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:32:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-01-09 15:32:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:55,287 INFO L225 Difference]: With dead ends: 758 [2025-01-09 15:32:55,287 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 15:32:55,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:32:55,289 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:55,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 558 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:32:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 15:32:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 392. [2025-01-09 15:32:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 361 states have (on average 1.3240997229916898) internal successors, (478), 361 states have internal predecessors, (478), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 520 transitions. [2025-01-09 15:32:55,304 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 520 transitions. Word has length 94 [2025-01-09 15:32:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:55,304 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 520 transitions. [2025-01-09 15:32:55,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 520 transitions. [2025-01-09 15:32:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 15:32:55,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:55,305 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:55,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 15:32:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:55,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash 444535940, now seen corresponding path program 1 times [2025-01-09 15:32:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997162709] [2025-01-09 15:32:55,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:55,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:55,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:32:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 15:32:55,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 15:32:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:55,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:32:55,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:56,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:56,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 110 [2025-01-09 15:32:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:56,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:56,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997162709] [2025-01-09 15:32:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997162709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:32:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336005252] [2025-01-09 15:32:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:32:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:32:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:32:56,609 INFO L87 Difference]: Start difference. First operand 392 states and 520 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:58,275 INFO L93 Difference]: Finished difference Result 765 states and 1014 transitions. [2025-01-09 15:32:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:32:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-01-09 15:32:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:58,278 INFO L225 Difference]: With dead ends: 765 [2025-01-09 15:32:58,278 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 15:32:58,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:32:58,280 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:58,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 845 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:32:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 15:32:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 386. [2025-01-09 15:32:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 355 states have (on average 1.3211267605633803) internal successors, (469), 355 states have internal predecessors, (469), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2025-01-09 15:32:58,297 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 94 [2025-01-09 15:32:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:58,297 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2025-01-09 15:32:58,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2025-01-09 15:32:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 15:32:58,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:58,298 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:58,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:32:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:58,499 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2082512293, now seen corresponding path program 1 times [2025-01-09 15:32:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:58,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890894604] [2025-01-09 15:32:58,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:58,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:58,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:32:58,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 15:32:58,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 15:32:58,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:58,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:58,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:32:58,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:58,932 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 21 treesize of output 9 [2025-01-09 15:32:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:32:59,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:59,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890894604] [2025-01-09 15:32:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890894604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:59,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:59,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:32:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732630164] [2025-01-09 15:32:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:59,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:32:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:59,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:32:59,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:32:59,245 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:59,532 INFO L93 Difference]: Finished difference Result 736 states and 980 transitions. [2025-01-09 15:32:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:32:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2025-01-09 15:32:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:59,535 INFO L225 Difference]: With dead ends: 736 [2025-01-09 15:32:59,535 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 15:32:59,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:32:59,537 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 171 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:59,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 573 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:32:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 15:32:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 415. [2025-01-09 15:32:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 384 states have (on average 1.3177083333333333) internal successors, (506), 384 states have internal predecessors, (506), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:32:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 548 transitions. [2025-01-09 15:32:59,554 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 548 transitions. Word has length 95 [2025-01-09 15:32:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 548 transitions. [2025-01-09 15:32:59,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:32:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 548 transitions. [2025-01-09 15:32:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 15:32:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:59,557 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:59,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 15:32:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:59,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1925423643, now seen corresponding path program 1 times [2025-01-09 15:32:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143541577] [2025-01-09 15:32:59,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:59,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:59,766 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:59,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:32:59,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 15:33:00,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 15:33:00,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:33:00,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:33:00,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:33:00,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:33:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:33:00,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:33:00,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:33:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143541577] [2025-01-09 15:33:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143541577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:33:00,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:33:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:33:00,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863149872] [2025-01-09 15:33:00,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:33:00,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:33:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:33:00,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:33:00,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:33:00,214 INFO L87 Difference]: Start difference. First operand 415 states and 548 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:33:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:33:00,318 INFO L93 Difference]: Finished difference Result 752 states and 999 transitions. [2025-01-09 15:33:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:33:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2025-01-09 15:33:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:33:00,320 INFO L225 Difference]: With dead ends: 752 [2025-01-09 15:33:00,320 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 15:33:00,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:33:00,321 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:33:00,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 630 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:33:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 15:33:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2025-01-09 15:33:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 391 states have (on average 1.3120204603580563) internal successors, (513), 391 states have internal predecessors, (513), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:33:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 555 transitions. [2025-01-09 15:33:00,334 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 555 transitions. Word has length 95 [2025-01-09 15:33:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:33:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 555 transitions. [2025-01-09 15:33:00,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:33:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 555 transitions. [2025-01-09 15:33:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 15:33:00,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:33:00,335 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:33:00,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:33:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:33:00,536 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:33:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:33:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash 784672517, now seen corresponding path program 1 times [2025-01-09 15:33:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:33:00,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059163016] [2025-01-09 15:33:00,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:33:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:33:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:33:00,542 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:33:00,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:33:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 15:33:01,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 15:33:01,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:33:01,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:33:01,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:33:01,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:33:01,383 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 17 treesize of output 13 [2025-01-09 15:33:01,626 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 62 treesize of output 46 [2025-01-09 15:33:01,630 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 45 treesize of output 33 [2025-01-09 15:33:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:33:01,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:33:01,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:33:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059163016] [2025-01-09 15:33:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059163016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:33:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:33:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:33:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183958617] [2025-01-09 15:33:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:33:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:33:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:33:01,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:33:01,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:33:01,699 INFO L87 Difference]: Start difference. First operand 422 states and 555 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 15:33:04,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:33:05,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []