./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.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-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:51:07,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:51:07,311 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:51:07,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:51:07,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:51:07,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:51:07,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:51:07,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:51:07,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:51:07,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:51:07,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:51:07,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:51:07,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:51:07,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:51:07,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:51:07,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:51:07,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:51:07,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:51:07,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:51:07,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:51:07,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:51:07,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:51:07,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:51:07,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:07,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:07,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:07,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:07,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:07,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:51:07,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:51:07,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:51:07,355 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2025-01-09 15:51:07,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:51:07,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:51:07,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:51:07,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:51:07,641 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:51:07,642 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-p_file-78.i [2025-01-09 15:51:08,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96b14b492/112afd27b5084292be6c1a4cd432204e/FLAG2bb3133ac [2025-01-09 15:51:09,208 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:51:09,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-01-09 15:51:09,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96b14b492/112afd27b5084292be6c1a4cd432204e/FLAG2bb3133ac [2025-01-09 15:51:09,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96b14b492/112afd27b5084292be6c1a4cd432204e [2025-01-09 15:51:09,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:51:09,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:51:09,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:09,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:51:09,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:51:09,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d00241d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09, skipping insertion in model container [2025-01-09 15:51:09,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:51:09,404 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-p_file-78.i[916,929] [2025-01-09 15:51:09,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:09,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:51:09,490 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-p_file-78.i[916,929] [2025-01-09 15:51:09,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:09,548 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:51:09,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09 WrapperNode [2025-01-09 15:51:09,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:09,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:09,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:51:09,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:51:09,558 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:51:09" (1/1) ... [2025-01-09 15:51:09,568 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:51:09" (1/1) ... [2025-01-09 15:51:09,606 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-01-09 15:51:09,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:09,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:51:09,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:51:09,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:51:09,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,669 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2025-01-09 15:51:09,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:51:09,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:51:09,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:51:09,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:51:09,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (1/1) ... [2025-01-09 15:51:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:09,733 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:51:09,736 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:51:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:51:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:51:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:51:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:51:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:51:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:51:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:51:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:51:09,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:51:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:51:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:51:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:51:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:51:09,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:51:09,936 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:51:09,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:51:10,419 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-01-09 15:51:10,419 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:51:10,435 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:51:10,437 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:51:10,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:10 BoogieIcfgContainer [2025-01-09 15:51:10,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:51:10,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:51:10,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:51:10,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:51:10,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:09" (1/3) ... [2025-01-09 15:51:10,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d44496a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:10, skipping insertion in model container [2025-01-09 15:51:10,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:09" (2/3) ... [2025-01-09 15:51:10,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d44496a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:10, skipping insertion in model container [2025-01-09 15:51:10,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:10" (3/3) ... [2025-01-09 15:51:10,447 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2025-01-09 15:51:10,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:51:10,461 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-78.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:51:10,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:51:10,526 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;@24f35806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:51:10,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:51:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:10,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:10,540 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1483262152, now seen corresponding path program 1 times [2025-01-09 15:51:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:10,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224192675] [2025-01-09 15:51:10,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:10,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 15:51:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224192675] [2025-01-09 15:51:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224192675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8058518] [2025-01-09 15:51:10,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:51:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:10,884 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:51:10,887 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:51:11,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:11,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:11,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:11,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:11,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:51:11,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 15:51:11,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8058518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:51:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:51:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984379457] [2025-01-09 15:51:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:11,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:51:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:51:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:51:11,200 INFO L87 Difference]: Start difference. First operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:11,221 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2025-01-09 15:51:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:51:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 15:51:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:11,227 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:51:11,227 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:51:11,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:51:11,233 INFO L435 NwaCegarLoop]: 129 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, 129 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:51:11,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:51:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:51:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-01-09 15:51:11,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2025-01-09 15:51:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:11,270 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-01-09 15:51:11,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-01-09 15:51:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:11,274 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:51:11,474 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:51:11,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 215738068, now seen corresponding path program 1 times [2025-01-09 15:51:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577899942] [2025-01-09 15:51:11,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:11,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:51:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577899942] [2025-01-09 15:51:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577899942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995155560] [2025-01-09 15:51:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:11,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:11,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:11,809 INFO L87 Difference]: Start difference. First operand 89 states and 129 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:11,879 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-01-09 15:51:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:11,881 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 15:51:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:11,882 INFO L225 Difference]: With dead ends: 177 [2025-01-09 15:51:11,882 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:51:11,883 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:51:11,883 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:51:11,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:51:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:51:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 15:51:11,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2025-01-09 15:51:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:11,898 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 15:51:11,898 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 15:51:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:11,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:11,901 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:51:11,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -32408426, now seen corresponding path program 1 times [2025-01-09 15:51:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289012271] [2025-01-09 15:51:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:11,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 15:51:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289012271] [2025-01-09 15:51:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289012271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952710243] [2025-01-09 15:51:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:12,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:51:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:12,184 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:51:12,185 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:51:12,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:12,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:12,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:12,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:12,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:51:12,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:51:12,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952710243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:51:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:51:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118310368] [2025-01-09 15:51:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:12,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:12,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:12,533 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:12,577 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2025-01-09 15:51:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:12,578 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2025-01-09 15:51:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:12,579 INFO L225 Difference]: With dead ends: 181 [2025-01-09 15:51:12,579 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:51:12,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:12,580 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:51:12,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:51:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:51:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-01-09 15:51:12,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2025-01-09 15:51:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:12,600 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-01-09 15:51:12,601 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-01-09 15:51:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:51:12,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:12,603 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:12,612 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:51:12,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:51:12,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1903941009, now seen corresponding path program 1 times [2025-01-09 15:51:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213337254] [2025-01-09 15:51:12,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:51:12,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:51:12,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:12,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:51:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213337254] [2025-01-09 15:51:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213337254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85253738] [2025-01-09 15:51:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:13,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:13,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:13,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:13,288 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:13,369 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2025-01-09 15:51:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:13,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2025-01-09 15:51:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:13,374 INFO L225 Difference]: With dead ends: 273 [2025-01-09 15:51:13,374 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 15:51:13,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:51:13,379 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:13,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 15:51:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2025-01-09 15:51:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2025-01-09 15:51:13,411 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 100 [2025-01-09 15:51:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2025-01-09 15:51:13,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2025-01-09 15:51:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:51:13,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:13,416 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:51:13,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 882872655, now seen corresponding path program 1 times [2025-01-09 15:51:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976275833] [2025-01-09 15:51:13,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:13,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:51:13,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:51:13,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:13,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:51:13,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:51:13,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:51:13,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:51:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:51:13,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:51:13,701 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:51:13,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:51:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:51:13,708 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 15:51:13,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:51:13,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:51:13 BoogieIcfgContainer [2025-01-09 15:51:13,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:51:13,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:51:13,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:51:13,910 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:51:13,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:10" (3/4) ... [2025-01-09 15:51:13,913 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:51:13,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:51:13,914 INFO L158 Benchmark]: Toolchain (without parser) took 4671.08ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.7MB in the beginning and 280.4MB in the end (delta: -174.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-01-09 15:51:13,915 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:13,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.22ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:51:13,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.02ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:13,917 INFO L158 Benchmark]: Boogie Preprocessor took 85.72ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:51:13,918 INFO L158 Benchmark]: RCFGBuilder took 739.88ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 51.8MB in the end (delta: 32.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:51:13,918 INFO L158 Benchmark]: TraceAbstraction took 3470.21ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.8MB in the beginning and 281.6MB in the end (delta: -230.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-01-09 15:51:13,919 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 327.2MB. Free memory was 281.6MB in the beginning and 280.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:13,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.22ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.02ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.72ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 739.88ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 51.8MB in the end (delta: 32.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3470.21ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.8MB in the beginning and 281.6MB in the end (delta: -230.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 327.2MB. Free memory was 281.6MB in the beginning and 280.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L22] signed long int var_1_1 = -200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] float var_1_9 = 100.55; [L28] float var_1_9 = 100.55; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 4.75; [L30] float var_1_10 = 4.75; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] float var_1_11 = 128.75; [L32] float var_1_11 = 128.75; [L33] float* var_1_11_Pointer = &(var_1_11); [L34] double var_1_12 = 128.5; [L34] double var_1_12 = 128.5; [L35] double* var_1_12_Pointer = &(var_1_12); [L36] double var_1_13 = 0.0; [L36] double var_1_13 = 0.0; [L37] double* var_1_13_Pointer = &(var_1_13); [L38] double var_1_14 = 127.875; [L38] double var_1_14 = 127.875; [L39] double* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 1; [L40] unsigned char var_1_15 = 1; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 16; [L42] unsigned char var_1_16 = 16; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] isInitial = 1 [L102] FCALL initially() [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L76] var_1_2 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_11 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET updateVariables() [L106] CALL step() [L47] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L47] COND TRUE 0.8f > (- (*(var_1_10_Pointer))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_15_Pointer) [L50] EXPR \read(*var_1_15_Pointer) [L50] unsigned char stepLocal_1 = (*(var_1_15_Pointer)) > (*(var_1_15_Pointer)); [L51] EXPR \read(*var_1_3_Pointer) [L51] unsigned char stepLocal_0 = (*(var_1_3_Pointer)); [L52] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L52] COND FALSE !((*(var_1_2_Pointer)) && stepLocal_0) [L59] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] COND TRUE (*(var_1_2_Pointer)) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_9_Pointer)) = ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] signed long int stepLocal_2 = (*(var_1_1_Pointer)); [L69] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_11_Pointer) [L72] (*(var_1_12_Pointer)) = (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_2_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) [L97] EXPR \read(*var_1_3_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) [L97] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR \read(*var_1_11_Pointer) [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97-L98] return (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 1224 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 721 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 503 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 872 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 1035/1080 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:51:13,939 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-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:51:16,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:51:16,401 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:51:16,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:51:16,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:51:16,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:51:16,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:51:16,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:51:16,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:51:16,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:51:16,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:51:16,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:51:16,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:51:16,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:51:16,469 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:51:16,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:51:16,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:51:16,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:51:16,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:51:16,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:51:16,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:16,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:16,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:16,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:51:16,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:51:16,471 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2025-01-09 15:51:16,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:51:16,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:51:16,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:51:16,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:51:16,742 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:51:16,745 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-p_file-78.i [2025-01-09 15:51:18,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21aac4d1b/5811268e805c44e09eaecf7af1654fe9/FLAGe58a021bd [2025-01-09 15:51:18,269 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:51:18,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-01-09 15:51:18,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21aac4d1b/5811268e805c44e09eaecf7af1654fe9/FLAGe58a021bd [2025-01-09 15:51:18,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21aac4d1b/5811268e805c44e09eaecf7af1654fe9 [2025-01-09 15:51:18,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:51:18,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:51:18,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:18,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:51:18,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:51:18,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f08a3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18, skipping insertion in model container [2025-01-09 15:51:18,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:51:18,728 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-p_file-78.i[916,929] [2025-01-09 15:51:18,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:18,808 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:51:18,819 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-p_file-78.i[916,929] [2025-01-09 15:51:18,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:18,863 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:51:18,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18 WrapperNode [2025-01-09 15:51:18,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:18,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:18,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:51:18,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:51:18,870 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:51:18" (1/1) ... [2025-01-09 15:51:18,886 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:51:18" (1/1) ... [2025-01-09 15:51:18,927 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-01-09 15:51:18,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:18,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:51:18,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:51:18,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:51:18,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,987 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2025-01-09 15:51:18,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:18,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:51:19,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:51:19,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:51:19,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:51:19,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (1/1) ... [2025-01-09 15:51:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:19,101 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:51:19,109 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:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-01-09 15:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:51:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:51:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:51:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:51:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:51:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:51:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:51:19,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:51:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:51:19,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:51:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:51:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:51:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:51:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:51:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:51:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:51:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:51:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:51:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-09 15:51:19,344 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:51:19,346 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:51:24,113 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 15:51:24,113 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:51:24,126 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:51:24,128 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:51:24,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:24 BoogieIcfgContainer [2025-01-09 15:51:24,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:51:24,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:51:24,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:51:24,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:51:24,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:18" (1/3) ... [2025-01-09 15:51:24,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5727eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:24, skipping insertion in model container [2025-01-09 15:51:24,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:18" (2/3) ... [2025-01-09 15:51:24,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5727eeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:24, skipping insertion in model container [2025-01-09 15:51:24,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:24" (3/3) ... [2025-01-09 15:51:24,138 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2025-01-09 15:51:24,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:51:24,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-78.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:51:24,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:51:24,216 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;@3331c68e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:51:24,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:51:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:24,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:24,228 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:24,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1483262152, now seen corresponding path program 1 times [2025-01-09 15:51:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:24,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578613745] [2025-01-09 15:51:24,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:24,246 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:51:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:24,250 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:51:24,251 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:51:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:24,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:24,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:51:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 15:51:24,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:24,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578613745] [2025-01-09 15:51:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578613745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:51:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986928414] [2025-01-09 15:51:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:51:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:24,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:51:24,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:51:24,823 INFO L87 Difference]: Start difference. First operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:24,851 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2025-01-09 15:51:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:51:24,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 15:51:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:24,858 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:51:24,858 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:51:24,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:51:24,862 INFO L435 NwaCegarLoop]: 129 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, 129 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:51:24,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:51:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:51:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-01-09 15:51:24,900 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2025-01-09 15:51:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:24,900 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-01-09 15:51:24,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-01-09 15:51:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:24,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:24,904 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,914 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:51:25,104 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:51:25,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 215738068, now seen corresponding path program 1 times [2025-01-09 15:51:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908564084] [2025-01-09 15:51:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:25,106 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:51:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:25,109 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:51:25,110 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:51:25,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:25,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:25,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:25,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:51:25,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 15:51:25,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:25,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908564084] [2025-01-09 15:51:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908564084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659810838] [2025-01-09 15:51:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:25,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:25,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:25,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:25,608 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:25,702 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-01-09 15:51:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 15:51:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:25,704 INFO L225 Difference]: With dead ends: 177 [2025-01-09 15:51:25,704 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:51:25,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:51:25,705 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:51:25,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:51:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:51:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 15:51:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 15:51:25,718 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2025-01-09 15:51:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:25,719 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 15:51:25,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 15:51:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:25,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:25,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:25,736 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:51:25,924 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:51:25,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash -32408426, now seen corresponding path program 1 times [2025-01-09 15:51:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430895786] [2025-01-09 15:51:25,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:25,926 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:51:25,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:25,928 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:51:25,931 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:51:26,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:26,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:26,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:26,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:26,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:51:26,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:51:26,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:26,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430895786] [2025-01-09 15:51:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430895786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:51:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513039220] [2025-01-09 15:51:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:26,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:26,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:26,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:26,897 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:28,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:28,936 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2025-01-09 15:51:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2025-01-09 15:51:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:28,939 INFO L225 Difference]: With dead ends: 267 [2025-01-09 15:51:28,939 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 15:51:28,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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:51:28,940 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:28,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 15:51:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 15:51:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2025-01-09 15:51:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 153 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2025-01-09 15:51:28,959 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 98 [2025-01-09 15:51:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2025-01-09 15:51:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2025-01-09 15:51:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:51:28,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:28,961 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,975 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:51:29,166 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:51:29,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1043525676, now seen corresponding path program 1 times [2025-01-09 15:51:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293109448] [2025-01-09 15:51:29,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:29,168 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:51:29,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:29,172 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:51:29,174 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:51:29,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:51:29,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:51:29,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:29,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:29,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:51:29,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:51:29,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:29,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:29,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293109448] [2025-01-09 15:51:29,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293109448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:29,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997329060] [2025-01-09 15:51:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:29,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:29,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:29,683 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:29,737 INFO L93 Difference]: Finished difference Result 353 states and 513 transitions. [2025-01-09 15:51:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:29,738 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2025-01-09 15:51:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:29,739 INFO L225 Difference]: With dead ends: 353 [2025-01-09 15:51:29,739 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 15:51:29,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:51:29,741 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:51:29,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 15:51:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 15:51:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2025-01-09 15:51:29,763 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 98 [2025-01-09 15:51:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2025-01-09 15:51:29,764 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 15:51:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2025-01-09 15:51:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:51:29,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:29,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 15:51:29,965 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:51:29,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:29,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 882872655, now seen corresponding path program 1 times [2025-01-09 15:51:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170646565] [2025-01-09 15:51:29,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:29,967 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:51:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:29,970 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:51:29,973 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:51:30,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:51:30,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:51:30,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:30,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:30,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:51:30,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:30,595 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:51:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:51:30,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:30,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:30,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170646565] [2025-01-09 15:51:30,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170646565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:30,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:30,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370716228] [2025-01-09 15:51:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:30,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:30,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:30,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:30,639 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:32,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.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:51:35,437 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:51:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:35,549 INFO L93 Difference]: Finished difference Result 359 states and 517 transitions. [2025-01-09 15:51:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:35,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-01-09 15:51:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:35,551 INFO L225 Difference]: With dead ends: 359 [2025-01-09 15:51:35,552 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 15:51:35,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 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:51:35,553 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:35,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 368 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 15:51:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 15:51:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-01-09 15:51:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 157 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 257 transitions. [2025-01-09 15:51:35,581 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 257 transitions. Word has length 100 [2025-01-09 15:51:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 257 transitions. [2025-01-09 15:51:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 257 transitions. [2025-01-09 15:51:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 15:51:35,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:35,583 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,602 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 (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:51:35,787 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:51:35,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1530032715, now seen corresponding path program 1 times [2025-01-09 15:51:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448783168] [2025-01-09 15:51:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:35,788 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:51:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:35,791 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:51:35,792 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:51:35,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 15:51:36,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 15:51:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:36,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:51:36,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:36,491 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:51:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 15:51:36,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:36,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448783168] [2025-01-09 15:51:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448783168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878576102] [2025-01-09 15:51:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:36,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:36,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:36,526 INFO L87 Difference]: Start difference. First operand 180 states and 257 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:39,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:43,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:43,133 INFO L93 Difference]: Finished difference Result 359 states and 513 transitions. [2025-01-09 15:51:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2025-01-09 15:51:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:43,136 INFO L225 Difference]: With dead ends: 359 [2025-01-09 15:51:43,136 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 15:51:43,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 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:51:43,137 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:43,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 370 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-01-09 15:51:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 15:51:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-01-09 15:51:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3694267515923566) internal successors, (215), 157 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 255 transitions. [2025-01-09 15:51:43,163 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 255 transitions. Word has length 102 [2025-01-09 15:51:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 255 transitions. [2025-01-09 15:51:43,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 255 transitions. [2025-01-09 15:51:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:51:43,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:43,169 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,183 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:51:43,369 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:51:43,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1179463791, now seen corresponding path program 1 times [2025-01-09 15:51:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101159998] [2025-01-09 15:51:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:43,371 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:51:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:43,373 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:51:43,374 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:51:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:51:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:51:43,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:43,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:51:43,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-09 15:51:43,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:43,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101159998] [2025-01-09 15:51:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101159998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:43,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:51:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286441530] [2025-01-09 15:51:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:43,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:43,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:43,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:43,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:43,905 INFO L87 Difference]: Start difference. First operand 180 states and 255 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 15:51:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:44,152 INFO L93 Difference]: Finished difference Result 365 states and 517 transitions. [2025-01-09 15:51:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:44,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2025-01-09 15:51:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:44,154 INFO L225 Difference]: With dead ends: 365 [2025-01-09 15:51:44,154 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 15:51:44,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:44,156 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:44,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 538 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:51:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 15:51:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2025-01-09 15:51:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.356687898089172) internal successors, (213), 157 states have internal predecessors, (213), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2025-01-09 15:51:44,170 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 104 [2025-01-09 15:51:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:44,170 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2025-01-09 15:51:44,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 15:51:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2025-01-09 15:51:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:51:44,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:44,172 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:44,186 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:51:44,372 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:51:44,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1153928847, now seen corresponding path program 1 times [2025-01-09 15:51:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928157631] [2025-01-09 15:51:44,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:44,374 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:51:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:44,376 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:51:44,377 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:51:44,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:51:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:51:45,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:45,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:45,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:51:45,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:45,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:45,325 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 157 treesize of output 67 [2025-01-09 15:51:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 15:51:45,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:45,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928157631] [2025-01-09 15:51:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928157631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36713440] [2025-01-09 15:51:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:45,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:45,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:45,361 INFO L87 Difference]: Start difference. First operand 180 states and 253 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:47,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:49,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:50,058 INFO L93 Difference]: Finished difference Result 359 states and 505 transitions. [2025-01-09 15:51:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-01-09 15:51:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:50,061 INFO L225 Difference]: With dead ends: 359 [2025-01-09 15:51:50,061 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 15:51:50,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:50,062 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 89 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:50,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 15:51:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 15:51:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-01-09 15:51:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 157 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2025-01-09 15:51:50,080 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 104 [2025-01-09 15:51:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:50,080 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2025-01-09 15:51:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2025-01-09 15:51:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:51:50,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:50,082 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:50,098 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 (9)] Ended with exit code 0 [2025-01-09 15:51:50,282 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:51:50,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -845335307, now seen corresponding path program 1 times [2025-01-09 15:51:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041315519] [2025-01-09 15:51:50,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:50,285 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:51:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:50,287 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:51:50,289 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:51:50,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:51:52,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:51:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:52,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:51:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:52,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:52,343 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 155 treesize of output 65 [2025-01-09 15:51:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 15:51:52,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:52,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041315519] [2025-01-09 15:51:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041315519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:52,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:52,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138972678] [2025-01-09 15:51:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:52,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:52,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:52,382 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:54,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:57,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:57,650 INFO L93 Difference]: Finished difference Result 357 states and 499 transitions. [2025-01-09 15:51:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2025-01-09 15:51:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:57,652 INFO L225 Difference]: With dead ends: 357 [2025-01-09 15:51:57,652 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 15:51:57,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:57,653 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 81 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:57,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 361 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 15:51:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 15:51:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2025-01-09 15:51:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 153 states have internal predecessors, (205), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2025-01-09 15:51:57,667 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 106 [2025-01-09 15:51:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:57,667 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2025-01-09 15:51:57,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 15:51:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2025-01-09 15:51:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:51:57,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:57,669 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,687 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 (10)] Ended with exit code 0 [2025-01-09 15:51:57,870 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:51:57,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:57,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash -130533619, now seen corresponding path program 1 times [2025-01-09 15:51:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:57,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025008559] [2025-01-09 15:51:57,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:57,871 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:51:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:57,873 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:51:57,874 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:51:58,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:52:10,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:52:10,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:10,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:10,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 15:52:10,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:52:20,051 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 237 treesize of output 177 [2025-01-09 15:52:20,068 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 201 treesize of output 141 [2025-01-09 15:52:20,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 83 [2025-01-09 15:52:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 4 proven. 128 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 15:52:21,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:52:31,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025008559] [2025-01-09 15:52:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025008559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:52:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399841251] [2025-01-09 15:52:31,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:52:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:52:31,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:52:31,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-01-09 15:52:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:52:33,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:52:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:33,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:52:33,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:35,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:52:35,899 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 179 treesize of output 83 [2025-01-09 15:52:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 15:52:37,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:52:39,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:52:39,504 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 148 treesize of output 1 [2025-01-09 15:52:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 15:52:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1399841251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:52:39,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:52:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 9] total 34 [2025-01-09 15:52:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035489172] [2025-01-09 15:52:39,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:52:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 15:52:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:39,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 15:52:39,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 15:52:39,531 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 8 states have call successors, (29), 7 states have call predecessors, (29), 8 states have return successors, (29), 6 states have call predecessors, (29), 8 states have call successors, (29)