./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.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-8.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 c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:51:18,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:51:18,297 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:18,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:51:18,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:51:18,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:51:18,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:51:18,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:51:18,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:51:18,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:51:18,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:51:18,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:51:18,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:51:18,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:51:18,330 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:51:18,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:51:18,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:51:18,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:51:18,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:51:18,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:18,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:18,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:18,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:51:18,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:51:18,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:51:18,333 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 -> c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f [2025-01-09 15:51:18,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:51:18,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:51:18,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:51:18,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:51:18,571 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:51:18,572 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-8.i [2025-01-09 15:51:19,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6076e696c/4a14eda099d04f10bf4fc429e03a10ae/FLAGa092455cd [2025-01-09 15:51:20,007 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:51:20,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.i [2025-01-09 15:51:20,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6076e696c/4a14eda099d04f10bf4fc429e03a10ae/FLAGa092455cd [2025-01-09 15:51:20,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6076e696c/4a14eda099d04f10bf4fc429e03a10ae [2025-01-09 15:51:20,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:51:20,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:51:20,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:20,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:51:20,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:51:20,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:20" (1/1) ... [2025-01-09 15:51:20,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e9330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20, skipping insertion in model container [2025-01-09 15:51:20,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:20" (1/1) ... [2025-01-09 15:51:20,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:51:20,168 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-8.i[915,928] [2025-01-09 15:51:20,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:20,234 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:51:20,244 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-8.i[915,928] [2025-01-09 15:51:20,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:20,286 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:51:20,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20 WrapperNode [2025-01-09 15:51:20,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:20,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:20,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:51:20,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:51:20,293 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:20" (1/1) ... [2025-01-09 15:51:20,305 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:20" (1/1) ... [2025-01-09 15:51:20,335 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 15:51:20,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:20,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:51:20,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:51:20,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:51:20,349 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:20" (1/1) ... [2025-01-09 15:51:20,350 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:20" (1/1) ... [2025-01-09 15:51:20,357 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:20" (1/1) ... [2025-01-09 15:51:20,375 INFO L175 MemorySlicer]: Split 126 memory accesses to 16 slices as follows [2, 5, 6, 6, 6, 6, 11, 5, 8, 12, 10, 10, 3, 11, 19, 6]. 15 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:51:20,376 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:20" (1/1) ... [2025-01-09 15:51:20,376 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:20" (1/1) ... [2025-01-09 15:51:20,392 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:20" (1/1) ... [2025-01-09 15:51:20,393 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:20" (1/1) ... [2025-01-09 15:51:20,396 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:20" (1/1) ... [2025-01-09 15:51:20,399 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:20" (1/1) ... [2025-01-09 15:51:20,400 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:20" (1/1) ... [2025-01-09 15:51:20,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:51:20,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:51:20,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:51:20,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:51:20,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 15:51:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:20,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:20,434 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:20,440 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:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:51:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:51:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:51:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-01-09 15:51:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-01-09 15:51:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:51:20,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 15:51:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:51:20,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:51:20,638 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:51:20,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:51:21,135 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:51:21,135 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:51:21,143 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:51:21,143 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:51:21,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:21 BoogieIcfgContainer [2025-01-09 15:51:21,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:51:21,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:51:21,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:51:21,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:51:21,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:20" (1/3) ... [2025-01-09 15:51:21,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1aad64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:21, skipping insertion in model container [2025-01-09 15:51:21,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (2/3) ... [2025-01-09 15:51:21,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1aad64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:21, skipping insertion in model container [2025-01-09 15:51:21,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:21" (3/3) ... [2025-01-09 15:51:21,151 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-8.i [2025-01-09 15:51:21,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:51:21,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-8.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:51:21,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:51:21,226 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;@13e1b747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:51:21,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:51:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:21,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:21,241 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:21,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1590503805, now seen corresponding path program 1 times [2025-01-09 15:51:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481957145] [2025-01-09 15:51:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:21,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:21,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:51:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:21,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481957145] [2025-01-09 15:51:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481957145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560662697] [2025-01-09 15:51:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:51:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:21,556 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:21,558 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:21,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:21,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:21,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:21,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:51:21,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:51:21,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560662697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:21,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:51:21,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:51:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342816533] [2025-01-09 15:51:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:51:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:21,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:51:21,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:51:21,851 INFO L87 Difference]: Start difference. First operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:51:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:21,867 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2025-01-09 15:51:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:51:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-01-09 15:51:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:21,872 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:51:21,872 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:51:21,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:21,877 INFO L435 NwaCegarLoop]: 138 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, 138 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:21,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 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:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:51:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 15:51:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 15:51:21,910 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2025-01-09 15:51:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:21,911 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 15:51:21,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:51:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 15:51:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:21,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:21,915 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:21,923 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:22,115 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:22,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -915180561, now seen corresponding path program 1 times [2025-01-09 15:51:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040331064] [2025-01-09 15:51:22,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:22,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:22,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040331064] [2025-01-09 15:51:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040331064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:22,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:22,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:22,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953361867] [2025-01-09 15:51:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:22,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:22,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:22,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:22,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:22,403 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:22,449 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 15:51:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:51:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:22,453 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:51:22,453 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:51:22,454 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:22,454 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:22,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:51:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-09 15:51:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-01-09 15:51:22,467 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2025-01-09 15:51:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:22,468 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-01-09 15:51:22,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-01-09 15:51:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:22,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:22,475 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:51:22,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:22,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -235122191, now seen corresponding path program 1 times [2025-01-09 15:51:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-01-09 15:51:22,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:22,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:22,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:22,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-01-09 15:51:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432478800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328016883] [2025-01-09 15:51:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:22,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:22,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:22,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:22,665 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:22,696 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-01-09 15:51:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:51:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:22,697 INFO L225 Difference]: With dead ends: 196 [2025-01-09 15:51:22,697 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:51:22,698 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:22,698 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:22,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:51:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 15:51:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-01-09 15:51:22,707 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2025-01-09 15:51:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-01-09 15:51:22,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-01-09 15:51:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:22,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:22,711 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:51:22,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1539885171, now seen corresponding path program 1 times [2025-01-09 15:51:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717037533] [2025-01-09 15:51:22,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:22,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717037533] [2025-01-09 15:51:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717037533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:22,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:51:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753672536] [2025-01-09 15:51:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:51:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:22,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:51:22,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:51:22,843 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:22,865 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-01-09 15:51:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:51:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:51:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:22,867 INFO L225 Difference]: With dead ends: 200 [2025-01-09 15:51:22,867 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 15:51:22,868 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:22,871 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:22,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 15:51:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 15:51:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-01-09 15:51:22,879 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2025-01-09 15:51:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:22,879 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-01-09 15:51:22,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-01-09 15:51:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:22,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:22,882 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:22,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:51:22,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:22,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1541732213, now seen corresponding path program 1 times [2025-01-09 15:51:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-01-09 15:51:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:22,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-01-09 15:51:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899546212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:51:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226672765] [2025-01-09 15:51:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:51:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:23,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:51:23,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:23,901 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:24,388 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2025-01-09 15:51:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:24,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-01-09 15:51:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:24,389 INFO L225 Difference]: With dead ends: 256 [2025-01-09 15:51:24,389 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:51:24,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:51:24,391 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 236 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:24,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 707 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:51:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:51:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2025-01-09 15:51:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2025-01-09 15:51:24,412 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2025-01-09 15:51:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:24,412 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2025-01-09 15:51:24,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2025-01-09 15:51:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:24,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:24,413 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:51:24,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:24,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash -147211529, now seen corresponding path program 1 times [2025-01-09 15:51:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:24,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025881271] [2025-01-09 15:51:24,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:24,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:24,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:24,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025881271] [2025-01-09 15:51:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025881271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:24,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113499177] [2025-01-09 15:51:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:24,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:51:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:24,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:51:24,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:51:24,739 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:24,814 INFO L93 Difference]: Finished difference Result 255 states and 354 transitions. [2025-01-09 15:51:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:51:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:51:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:24,816 INFO L225 Difference]: With dead ends: 255 [2025-01-09 15:51:24,816 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 15:51:24,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:24,817 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 64 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:24,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 574 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 15:51:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-01-09 15:51:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 131 states have internal predecessors, (171), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 211 transitions. [2025-01-09 15:51:24,838 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 211 transitions. Word has length 123 [2025-01-09 15:51:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 211 transitions. [2025-01-09 15:51:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2025-01-09 15:51:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:24,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:24,839 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:51:24,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:24,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1869959090, now seen corresponding path program 1 times [2025-01-09 15:51:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-01-09 15:51:24,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:24,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-01-09 15:51:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825683392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:25,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:25,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:51:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439043095] [2025-01-09 15:51:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:25,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:51:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:25,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:51:25,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:51:25,319 INFO L87 Difference]: Start difference. First operand 153 states and 211 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:25,868 INFO L93 Difference]: Finished difference Result 406 states and 564 transitions. [2025-01-09 15:51:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:51:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:51:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:25,871 INFO L225 Difference]: With dead ends: 406 [2025-01-09 15:51:25,871 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 15:51:25,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:51:25,872 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 305 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1233 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:51:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 15:51:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 193. [2025-01-09 15:51:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 162 states have internal predecessors, (213), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2025-01-09 15:51:25,911 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 125 [2025-01-09 15:51:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2025-01-09 15:51:25,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2025-01-09 15:51:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:25,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:25,913 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:25,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:51:25,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1727980462, now seen corresponding path program 1 times [2025-01-09 15:51:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962941730] [2025-01-09 15:51:25,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:25,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:25,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962941730] [2025-01-09 15:51:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962941730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:51:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721125094] [2025-01-09 15:51:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:51:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:26,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:51:26,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:51:26,639 INFO L87 Difference]: Start difference. First operand 193 states and 269 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:27,358 INFO L93 Difference]: Finished difference Result 440 states and 612 transitions. [2025-01-09 15:51:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:51:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-01-09 15:51:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:27,360 INFO L225 Difference]: With dead ends: 440 [2025-01-09 15:51:27,360 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 15:51:27,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:51:27,361 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 459 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:27,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 964 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:51:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 15:51:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 187. [2025-01-09 15:51:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2025-01-09 15:51:27,383 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 125 [2025-01-09 15:51:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:27,383 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2025-01-09 15:51:27,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2025-01-09 15:51:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:27,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:27,384 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:27,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:51:27,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1356617847, now seen corresponding path program 1 times [2025-01-09 15:51:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564649130] [2025-01-09 15:51:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:27,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:27,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:27,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564649130] [2025-01-09 15:51:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564649130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:51:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032355608] [2025-01-09 15:51:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:27,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:27,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:27,728 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:27,838 INFO L93 Difference]: Finished difference Result 436 states and 606 transitions. [2025-01-09 15:51:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:51:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:51:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:27,841 INFO L225 Difference]: With dead ends: 436 [2025-01-09 15:51:27,842 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 15:51:27,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:27,843 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 124 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:27,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 882 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 15:51:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 193. [2025-01-09 15:51:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 265 transitions. [2025-01-09 15:51:27,873 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 265 transitions. Word has length 125 [2025-01-09 15:51:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:27,873 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 265 transitions. [2025-01-09 15:51:27,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2025-01-09 15:51:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:27,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:27,874 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:51:27,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:27,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash -257266099, now seen corresponding path program 1 times [2025-01-09 15:51:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081972063] [2025-01-09 15:51:27,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:27,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:27,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:27,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:27,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081972063] [2025-01-09 15:51:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081972063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:51:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450723566] [2025-01-09 15:51:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:51:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:28,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:51:28,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:51:28,286 INFO L87 Difference]: Start difference. First operand 193 states and 265 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:28,436 INFO L93 Difference]: Finished difference Result 547 states and 756 transitions. [2025-01-09 15:51:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:51:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:51:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:28,439 INFO L225 Difference]: With dead ends: 547 [2025-01-09 15:51:28,439 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 15:51:28,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:51:28,440 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 135 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:28,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 890 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 15:51:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 200. [2025-01-09 15:51:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.2916666666666667) internal successors, (217), 169 states have internal predecessors, (217), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 273 transitions. [2025-01-09 15:51:28,468 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 273 transitions. Word has length 127 [2025-01-09 15:51:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 273 transitions. [2025-01-09 15:51:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 273 transitions. [2025-01-09 15:51:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:28,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:28,470 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:51:28,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:28,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 826517902, now seen corresponding path program 1 times [2025-01-09 15:51:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550882228] [2025-01-09 15:51:28,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:28,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:28,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550882228] [2025-01-09 15:51:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550882228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:51:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213048116] [2025-01-09 15:51:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:51:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:28,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:51:28,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:28,759 INFO L87 Difference]: Start difference. First operand 200 states and 273 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:28,871 INFO L93 Difference]: Finished difference Result 456 states and 627 transitions. [2025-01-09 15:51:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:51:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:28,873 INFO L225 Difference]: With dead ends: 456 [2025-01-09 15:51:28,873 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 15:51:28,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:51:28,874 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 122 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:28,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1079 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 15:51:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 194. [2025-01-09 15:51:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 163 states have internal predecessors, (210), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2025-01-09 15:51:28,901 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 127 [2025-01-09 15:51:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:28,901 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2025-01-09 15:51:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2025-01-09 15:51:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:28,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:28,903 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:51:28,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -189646306, now seen corresponding path program 1 times [2025-01-09 15:51:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212659352] [2025-01-09 15:51:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:28,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:28,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212659352] [2025-01-09 15:51:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212659352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593616720] [2025-01-09 15:51:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:51:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:29,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:51:29,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:51:29,110 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:29,259 INFO L93 Difference]: Finished difference Result 385 states and 529 transitions. [2025-01-09 15:51:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:51:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:51:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:29,261 INFO L225 Difference]: With dead ends: 385 [2025-01-09 15:51:29,261 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 15:51:29,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:29,263 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 120 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:29,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 301 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 15:51:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-09 15:51:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.2839506172839505) internal successors, (208), 163 states have internal predecessors, (208), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:51:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2025-01-09 15:51:29,289 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 127 [2025-01-09 15:51:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:29,291 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2025-01-09 15:51:29,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2025-01-09 15:51:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:29,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:29,292 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:29,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:51:29,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 68519132, now seen corresponding path program 1 times [2025-01-09 15:51:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077481704] [2025-01-09 15:51:29,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:29,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:29,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:29,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:29,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077481704] [2025-01-09 15:51:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077481704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:51:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205026479] [2025-01-09 15:51:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:51:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:29,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:51:29,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:29,823 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:30,131 INFO L93 Difference]: Finished difference Result 260 states and 352 transitions. [2025-01-09 15:51:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:51:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-01-09 15:51:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:30,134 INFO L225 Difference]: With dead ends: 260 [2025-01-09 15:51:30,134 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 15:51:30,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:51:30,135 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 264 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:30,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 935 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:51:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 15:51:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2025-01-09 15:51:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 210 states have (on average 1.276190476190476) internal successors, (268), 212 states have internal predecessors, (268), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:51:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2025-01-09 15:51:30,175 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 127 [2025-01-09 15:51:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:30,176 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2025-01-09 15:51:30,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:51:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2025-01-09 15:51:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:30,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:30,177 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:30,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:51:30,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:30,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash 70366174, now seen corresponding path program 1 times [2025-01-09 15:51:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426795336] [2025-01-09 15:51:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:30,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:30,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:30,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:51:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426795336] [2025-01-09 15:51:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426795336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:30,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:51:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582468837] [2025-01-09 15:51:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:30,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:51:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:51:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:51:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:51:30,440 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:30,539 INFO L93 Difference]: Finished difference Result 472 states and 632 transitions. [2025-01-09 15:51:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:51:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:51:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:30,541 INFO L225 Difference]: With dead ends: 472 [2025-01-09 15:51:30,542 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 15:51:30,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:51:30,542 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 115 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:30,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 671 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 15:51:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2025-01-09 15:51:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 212 states have internal predecessors, (266), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:51:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2025-01-09 15:51:30,595 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 127 [2025-01-09 15:51:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:30,596 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2025-01-09 15:51:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2025-01-09 15:51:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:30,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:30,597 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:51:30,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1845373536, now seen corresponding path program 1 times [2025-01-09 15:51:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:51:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574916885] [2025-01-09 15:51:30,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:51:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:30,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:30,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:30,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:51:30,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066246146] [2025-01-09 15:51:30,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:30,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:51:30,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:30,670 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:30,673 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:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:31,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:31,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:31,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:51:31,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:51:31,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:31,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:31,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:31,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:51:31,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:51:31,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:51:31,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:51:31,428 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:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 15:51:31,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:31,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:51:31,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:51:31 BoogieIcfgContainer [2025-01-09 15:51:31,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:51:31,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:51:31,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:51:31,789 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:51:31,789 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:21" (3/4) ... [2025-01-09 15:51:31,791 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:51:31,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:51:31,792 INFO L158 Benchmark]: Toolchain (without parser) took 11758.40ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 107.7MB in the beginning and 341.7MB in the end (delta: -234.0MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2025-01-09 15:51:31,792 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:31,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.67ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 92.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:51:31,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:31,793 INFO L158 Benchmark]: Boogie Preprocessor took 67.65ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:51:31,793 INFO L158 Benchmark]: RCFGBuilder took 739.46ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 47.5MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:51:31,793 INFO L158 Benchmark]: TraceAbstraction took 10643.36ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 47.5MB in the beginning and 341.8MB in the end (delta: -294.3MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2025-01-09 15:51:31,793 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 545.3MB. Free memory was 341.8MB in the beginning and 341.7MB in the end (delta: 93.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:51:31,794 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.67ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 92.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.65ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 739.46ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 47.5MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10643.36ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 47.5MB in the beginning and 341.8MB in the end (delta: -294.3MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 545.3MB. Free memory was 341.8MB in the beginning and 341.7MB in the end (delta: 93.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 0; [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 0; [L30] unsigned char var_1_7 = 0; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 64; [L32] signed long int var_1_8 = 64; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] float var_1_12 = 2.4; [L34] float var_1_12 = 2.4; [L35] float* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 127.75; [L36] float var_1_13 = 127.75; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 0.0; [L38] float var_1_14 = 0.0; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 31.4; [L40] float var_1_15 = 31.4; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.75; [L42] float var_1_16 = 256.75; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] float var_1_17 = 256.6; [L44] float var_1_17 = 256.6; [L45] float* var_1_17_Pointer = &(var_1_17); [L46] signed long int var_1_18 = 0; [L46] signed long int var_1_18 = 0; [L47] signed long int* var_1_18_Pointer = &(var_1_18); [L48] unsigned char var_1_19 = 32; [L48] unsigned char var_1_19 = 32; [L49] unsigned char* var_1_19_Pointer = &(var_1_19); [L50] unsigned char var_1_20 = 100; [L50] unsigned char var_1_20 = 100; [L51] unsigned char* var_1_20_Pointer = &(var_1_20); VAL [isInitial=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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L113] isInitial = 1 [L114] FCALL initially() [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L82] var_1_4 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_4) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L84] EXPR \read(var_1_4) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L84] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L84] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L85] var_1_5 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_5) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L87] EXPR \read(var_1_5) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_6) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L90] EXPR \read(var_1_6) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_7) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L93] EXPR \read(var_1_7) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L94] var_1_13 = __VERIFIER_nondet_float() [L95] EXPR \read(var_1_13) [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L95] EXPR \read(var_1_13) [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L95] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L95] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L95] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L95] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L96] var_1_14 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_14) [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F [L97] EXPR \read(var_1_14) [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L97] EXPR (var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L97] EXPR (var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && 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_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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L98] var_1_15 = __VERIFIER_nondet_float() [L99] EXPR \read(var_1_15) [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L99] EXPR \read(var_1_15) [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L99] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L99] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L99] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L99] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L100] var_1_16 = __VERIFIER_nondet_float() [L101] EXPR \read(var_1_16) [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L101] EXPR \read(var_1_16) [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L101] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L101] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L101] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L101] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L102] var_1_20 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_20) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L103] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L103] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L104] EXPR \read(var_1_20) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L117] RET updateVariables() [L118] CALL step() [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_17_Pointer)) = (*(var_1_14_Pointer)) [L56] EXPR \read(*var_1_20_Pointer) [L56] (*(var_1_19_Pointer)) = (*(var_1_20_Pointer)) [L57] EXPR \read(*var_1_19_Pointer) [L57] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L58] EXPR \read(*var_1_19_Pointer) [L58] unsigned char stepLocal_1 = (*(var_1_19_Pointer)); [L59] EXPR \read(*var_1_18_Pointer) [L59] EXPR \read(*var_1_18_Pointer) [L59] EXPR \read(*var_1_19_Pointer) [L59] EXPR \read(*var_1_19_Pointer) [L59] signed long int stepLocal_0 = ((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer))); [L60] COND FALSE !(stepLocal_0 >= 1u) [L67] EXPR \read(*var_1_19_Pointer) [L67] (*(var_1_8_Pointer)) = (*(var_1_19_Pointer)) [L69] EXPR \read(*var_1_8_Pointer) [L69] signed long int stepLocal_2 = (*(var_1_8_Pointer)); [L70] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L70] COND FALSE !((*(var_1_19_Pointer)) > stepLocal_2) [L73] EXPR \read(*var_1_16_Pointer) [L73] EXPR \read(*var_1_14_Pointer) [L73] EXPR \read(*var_1_15_Pointer) [L73] (*(var_1_12_Pointer)) = ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))) [L75] EXPR \read(*var_1_18_Pointer) [L75] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L75] COND FALSE !((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) [L78] EXPR \read(*var_1_7_Pointer) [L78] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) [L109] EXPR \read(*var_1_1_Pointer) [L109] EXPR \read(*var_1_7_Pointer) [L109] EXPR ((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) [L109] EXPR \read(*var_1_8_Pointer) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR ((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))) [L109] EXPR \read(*var_1_12_Pointer) [L109] EXPR \read(*var_1_16_Pointer) [L109] EXPR \read(*var_1_14_Pointer) [L109] EXPR \read(*var_1_15_Pointer) [L109] EXPR ((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) [L109] EXPR \read(*var_1_17_Pointer) [L109] EXPR \read(*var_1_14_Pointer) [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR ((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109] EXPR (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L109-L110] return (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, 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_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1947 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1947 mSDsluCounter, 9560 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7100 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1734 IncrementalHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 2460 mSDtfsCounter, 1734 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=13, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 479 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2125 NumberOfCodeBlocks, 2125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1856 ConstructedInterpolants, 0 QuantifiedInterpolants, 4755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 5434/5460 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:31,823 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-8.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 c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:51:33,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:51:33,857 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:33,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:51:33,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:51:33,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:51:33,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:51:33,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:51:33,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:51:33,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:51:33,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:51:33,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:51:33,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:51:33,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:51:33,899 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:51:33,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:51:33,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:51:33,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:51:33,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:51:33,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:51:33,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:51:33,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:51:33,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:33,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:33,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:33,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:51:33,902 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:51:33,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:51:33,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:51:33,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:51:33,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:51:33,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:51:33,903 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 -> c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f [2025-01-09 15:51:34,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:51:34,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:51:34,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:51:34,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:51:34,130 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:51:34,131 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-8.i [2025-01-09 15:51:35,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f5ea4a8/b8cee192f40c435ab51b008d6fa0958d/FLAGf060e885f [2025-01-09 15:51:35,673 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:51:35,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.i [2025-01-09 15:51:35,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f5ea4a8/b8cee192f40c435ab51b008d6fa0958d/FLAGf060e885f [2025-01-09 15:51:35,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f5ea4a8/b8cee192f40c435ab51b008d6fa0958d [2025-01-09 15:51:35,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:51:35,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:51:35,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:35,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:51:35,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:51:35,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:35" (1/1) ... [2025-01-09 15:51:35,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b356991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:35, skipping insertion in model container [2025-01-09 15:51:35,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:35" (1/1) ... [2025-01-09 15:51:35,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:51:35,832 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-8.i[915,928] [2025-01-09 15:51:35,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:35,889 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:51:35,896 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-8.i[915,928] [2025-01-09 15:51:35,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:51:35,942 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:51:35,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:35 WrapperNode [2025-01-09 15:51:35,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:51:35,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:35,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:51:35,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:51:35,947 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:35" (1/1) ... [2025-01-09 15:51:35,957 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:35" (1/1) ... [2025-01-09 15:51:35,986 INFO L138 Inliner]: procedures = 33, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 15:51:35,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:51:35,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:51:35,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:51:35,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:51:35,995 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:35" (1/1) ... [2025-01-09 15:51:35,996 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:35" (1/1) ... [2025-01-09 15:51:36,000 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:35" (1/1) ... [2025-01-09 15:51:36,020 INFO L175 MemorySlicer]: Split 126 memory accesses to 16 slices as follows [2, 5, 6, 6, 6, 6, 11, 5, 8, 12, 10, 10, 3, 11, 19, 6]. 15 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:51:36,021 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:35" (1/1) ... [2025-01-09 15:51:36,021 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:35" (1/1) ... [2025-01-09 15:51:36,035 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:35" (1/1) ... [2025-01-09 15:51:36,036 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:35" (1/1) ... [2025-01-09 15:51:36,039 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:35" (1/1) ... [2025-01-09 15:51:36,043 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:35" (1/1) ... [2025-01-09 15:51:36,046 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:35" (1/1) ... [2025-01-09 15:51:36,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:51:36,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:51:36,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:51:36,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:51:36,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:35" (1/1) ... [2025-01-09 15:51:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:51:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:51:36,078 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:36,086 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:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:51:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:51:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:51:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:51:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:51:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:51:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:51:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:51:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:51:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-01-09 15:51:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-01-09 15:51:36,341 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:51:36,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:51:39,653 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:51:39,653 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:51:39,660 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:51:39,660 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:51:39,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:39 BoogieIcfgContainer [2025-01-09 15:51:39,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:51:39,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:51:39,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:51:39,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:51:39,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:35" (1/3) ... [2025-01-09 15:51:39,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c96c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:39, skipping insertion in model container [2025-01-09 15:51:39,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:35" (2/3) ... [2025-01-09 15:51:39,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c96c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:39, skipping insertion in model container [2025-01-09 15:51:39,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:39" (3/3) ... [2025-01-09 15:51:39,666 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-8.i [2025-01-09 15:51:39,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:51:39,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-8.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:51:39,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:51:39,763 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;@271aa9cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:51:39,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:51:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:39,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:39,774 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:39,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:39,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1590503805, now seen corresponding path program 1 times [2025-01-09 15:51:39,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19694866] [2025-01-09 15:51:39,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:39,785 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:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:39,788 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:39,790 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:39,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:40,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:40,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:40,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:51:40,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 15:51:40,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:40,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19694866] [2025-01-09 15:51:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19694866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:51:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636985558] [2025-01-09 15:51:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:51:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:40,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:51:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:51:40,296 INFO L87 Difference]: Start difference. First operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:51:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:40,315 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2025-01-09 15:51:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:51:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-01-09 15:51:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:40,320 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:51:40,320 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:51:40,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:40,324 INFO L435 NwaCegarLoop]: 138 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, 138 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:40,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 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:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:51:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 15:51:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 15:51:40,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2025-01-09 15:51:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 15:51:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:51:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 15:51:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:51:40,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:40,365 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:40,379 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:40,566 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:40,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -915180561, now seen corresponding path program 1 times [2025-01-09 15:51:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163639384] [2025-01-09 15:51:40,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:40,568 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:40,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:40,570 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:40,571 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:40,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:51:40,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:51:40,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:40,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:40,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:51:40,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:41,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:51:41,712 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 54 treesize of output 42 [2025-01-09 15:51:41,716 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 63 treesize of output 39 [2025-01-09 15:51:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 214 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 15:51:41,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:41,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163639384] [2025-01-09 15:51:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163639384] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:41,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:51:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-01-09 15:51:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556533164] [2025-01-09 15:51:41,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:41,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:51:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:41,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:51:41,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:51:41,861 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:41,948 INFO L93 Difference]: Finished difference Result 237 states and 338 transitions. [2025-01-09 15:51:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:51:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:51:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:41,950 INFO L225 Difference]: With dead ends: 237 [2025-01-09 15:51:41,950 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 15:51:41,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:51:41,951 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 64 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:41,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 578 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:51:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 15:51:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2025-01-09 15:51:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 119 states have internal predecessors, (160), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 200 transitions. [2025-01-09 15:51:41,961 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 200 transitions. Word has length 123 [2025-01-09 15:51:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 200 transitions. [2025-01-09 15:51:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 200 transitions. [2025-01-09 15:51:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:41,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:41,963 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:41,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:51:42,167 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:42,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1009655510, now seen corresponding path program 1 times [2025-01-09 15:51:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:42,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582705861] [2025-01-09 15:51:42,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:42,169 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:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:42,171 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:42,173 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:42,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:42,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:42,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:51:42,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:42,995 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 33 treesize of output 21 [2025-01-09 15:51:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:51:43,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:43,320 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:51:43,320 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 20 treesize of output 19 [2025-01-09 15:51:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:51:43,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582705861] [2025-01-09 15:51:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582705861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:43,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-01-09 15:51:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368559582] [2025-01-09 15:51:43,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:51:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:51:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:51:43,360 INFO L87 Difference]: Start difference. First operand 141 states and 200 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:43,820 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2025-01-09 15:51:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:51:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 125 [2025-01-09 15:51:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:43,823 INFO L225 Difference]: With dead ends: 295 [2025-01-09 15:51:43,823 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:51:43,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:51:43,824 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 248 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:43,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 535 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:51:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:51:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-01-09 15:51:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 125 states have internal predecessors, (165), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 205 transitions. [2025-01-09 15:51:43,842 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 205 transitions. Word has length 125 [2025-01-09 15:51:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:43,843 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 205 transitions. [2025-01-09 15:51:43,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2025-01-09 15:51:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:43,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:43,844 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:43,855 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:44,045 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:44,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -312627766, now seen corresponding path program 1 times [2025-01-09 15:51:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160684181] [2025-01-09 15:51:44,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:44,046 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,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:44,053 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:44,054 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:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:44,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:44,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:51:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:44,665 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 33 treesize of output 21 [2025-01-09 15:51:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:51:44,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:44,907 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:51:44,907 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 20 treesize of output 19 [2025-01-09 15:51:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:51:44,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160684181] [2025-01-09 15:51:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160684181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:44,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:44,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-01-09 15:51:44,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468375575] [2025-01-09 15:51:44,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:44,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:51:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:44,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:51:44,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:51:44,937 INFO L87 Difference]: Start difference. First operand 149 states and 205 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:45,345 INFO L93 Difference]: Finished difference Result 303 states and 415 transitions. [2025-01-09 15:51:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:51:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 125 [2025-01-09 15:51:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:45,347 INFO L225 Difference]: With dead ends: 303 [2025-01-09 15:51:45,347 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:51:45,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:51:45,348 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 382 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:45,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 529 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:51:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:51:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-01-09 15:51:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.314516129032258) internal successors, (163), 125 states have internal predecessors, (163), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:51:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2025-01-09 15:51:45,371 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 125 [2025-01-09 15:51:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:45,371 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2025-01-09 15:51:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2025-01-09 15:51:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:51:45,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:45,373 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:45,385 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:45,573 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:45,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 58734849, now seen corresponding path program 1 times [2025-01-09 15:51:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339187194] [2025-01-09 15:51:45,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:45,575 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:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:45,580 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:45,584 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:45,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:51:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:51:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:45,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:51:46,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:46,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:51:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:51:46,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:46,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339187194] [2025-01-09 15:51:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339187194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:46,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:51:46,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:51:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11901724] [2025-01-09 15:51:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:46,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:46,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:46,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:51:46,088 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:46,328 INFO L93 Difference]: Finished difference Result 364 states and 497 transitions. [2025-01-09 15:51:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:51:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:51:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:46,331 INFO L225 Difference]: With dead ends: 364 [2025-01-09 15:51:46,331 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 15:51:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:51:46,332 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 123 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 878 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:51:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 15:51:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2025-01-09 15:51:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 174 states have (on average 1.293103448275862) internal successors, (225), 176 states have internal predecessors, (225), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:51:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 293 transitions. [2025-01-09 15:51:46,349 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 293 transitions. Word has length 125 [2025-01-09 15:51:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 293 transitions. [2025-01-09 15:51:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:51:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2025-01-09 15:51:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:46,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:46,351 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:46,364 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:46,551 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:46,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -55893882, now seen corresponding path program 1 times [2025-01-09 15:51:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013791168] [2025-01-09 15:51:46,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:46,552 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:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:46,557 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:46,559 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:46,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:46,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:51:46,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:48,077 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 33 treesize of output 21 [2025-01-09 15:51:48,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:51:48,206 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 49 treesize of output 37 [2025-01-09 15:51:48,209 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 53 treesize of output 37 [2025-01-09 15:51:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 254 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:51:48,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:48,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 15:51:48,351 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 15:51:48,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:48,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2025-01-09 15:51:48,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2025-01-09 15:51:48,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 35 [2025-01-09 15:51:49,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:49,552 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 65 treesize of output 60 [2025-01-09 15:51:49,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:49,801 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 27 treesize of output 30 [2025-01-09 15:51:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 48 proven. 60 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-09 15:51:49,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013791168] [2025-01-09 15:51:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013791168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:49,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2025-01-09 15:51:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199941202] [2025-01-09 15:51:49,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 15:51:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:49,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 15:51:49,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 15:51:49,961 INFO L87 Difference]: Start difference. First operand 216 states and 293 transitions. Second operand has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 15:51:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:53,183 INFO L93 Difference]: Finished difference Result 483 states and 621 transitions. [2025-01-09 15:51:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 15:51:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) Word has length 127 [2025-01-09 15:51:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:53,188 INFO L225 Difference]: With dead ends: 483 [2025-01-09 15:51:53,188 INFO L226 Difference]: Without dead ends: 331 [2025-01-09 15:51:53,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1026, Invalid=5294, Unknown=0, NotChecked=0, Total=6320 [2025-01-09 15:51:53,192 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 976 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:53,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1880 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:51:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-09 15:51:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 238. [2025-01-09 15:51:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.265625) internal successors, (243), 194 states have internal predecessors, (243), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 15:51:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2025-01-09 15:51:53,211 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 127 [2025-01-09 15:51:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:53,212 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2025-01-09 15:51:53,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 15:51:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2025-01-09 15:51:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:53,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:53,214 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:53,234 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:53,415 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:53,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:53,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1633049860, now seen corresponding path program 1 times [2025-01-09 15:51:53,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:53,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446738508] [2025-01-09 15:51:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:53,417 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:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:53,418 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:53,420 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:53,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:53,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:51:53,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:54,042 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 33 treesize of output 21 [2025-01-09 15:51:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 15:51:54,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:54,257 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:51:54,257 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 20 treesize of output 19 [2025-01-09 15:51:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:51:54,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446738508] [2025-01-09 15:51:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446738508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:54,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-01-09 15:51:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306020971] [2025-01-09 15:51:54,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:51:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:54,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:51:54,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:51:54,299 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:54,601 INFO L93 Difference]: Finished difference Result 372 states and 476 transitions. [2025-01-09 15:51:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:51:54,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 127 [2025-01-09 15:51:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:54,605 INFO L225 Difference]: With dead ends: 372 [2025-01-09 15:51:54,606 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 15:51:54,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:51:54,607 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 315 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:54,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 520 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:51:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 15:51:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 121. [2025-01-09 15:51:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.27) internal successors, (127), 100 states have internal predecessors, (127), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2025-01-09 15:51:54,623 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 127 [2025-01-09 15:51:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2025-01-09 15:51:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2025-01-09 15:51:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:54,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:54,625 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:54,635 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:54,828 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:54,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1569200644, now seen corresponding path program 1 times [2025-01-09 15:51:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540543367] [2025-01-09 15:51:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:54,830 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:54,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:54,831 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:54,832 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:54,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:55,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:55,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:55,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:55,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:51:55,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:55,378 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 33 treesize of output 21 [2025-01-09 15:51:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 15:51:55,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:55,570 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:51:55,571 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 20 treesize of output 19 [2025-01-09 15:51:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:51:55,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540543367] [2025-01-09 15:51:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540543367] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:55,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-01-09 15:51:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997224883] [2025-01-09 15:51:55,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:51:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:51:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:51:55,610 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:55,876 INFO L93 Difference]: Finished difference Result 247 states and 315 transitions. [2025-01-09 15:51:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:51:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 127 [2025-01-09 15:51:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:55,878 INFO L225 Difference]: With dead ends: 247 [2025-01-09 15:51:55,878 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 15:51:55,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:51:55,879 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 167 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:55,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 516 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:51:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 15:51:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-01-09 15:51:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:51:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2025-01-09 15:51:55,895 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 127 [2025-01-09 15:51:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:55,895 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2025-01-09 15:51:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 15:51:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2025-01-09 15:51:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:51:55,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:55,897 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:55,913 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:56,101 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:56,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -19147258, now seen corresponding path program 1 times [2025-01-09 15:51:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:56,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125281179] [2025-01-09 15:51:56,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:56,102 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:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:56,104 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:56,105 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:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:51:56,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:51:56,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:56,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:56,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:51:56,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:57,299 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 36 treesize of output 24 [2025-01-09 15:51:57,303 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 13 treesize of output 9 [2025-01-09 15:51:57,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:51:57,445 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 33 treesize of output 21 [2025-01-09 15:51:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 254 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:51:57,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:58,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:58,872 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 63 treesize of output 58 [2025-01-09 15:51:59,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:59,122 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 27 treesize of output 30 [2025-01-09 15:51:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 48 proven. 60 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-09 15:51:59,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:59,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125281179] [2025-01-09 15:51:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125281179] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:51:59,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:51:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2025-01-09 15:51:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647664704] [2025-01-09 15:51:59,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:51:59,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 15:51:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 15:51:59,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 15:51:59,285 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand has 39 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 15:52:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:02,319 INFO L93 Difference]: Finished difference Result 324 states and 403 transitions. [2025-01-09 15:52:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 15:52:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) Word has length 127 [2025-01-09 15:52:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:02,322 INFO L225 Difference]: With dead ends: 324 [2025-01-09 15:52:02,322 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 15:52:02,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=798, Invalid=3758, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 15:52:02,324 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1277 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:02,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1979 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:52:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 15:52:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 127. [2025-01-09 15:52:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 106 states have internal predecessors, (133), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2025-01-09 15:52:02,335 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 127 [2025-01-09 15:52:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:02,336 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2025-01-09 15:52:02,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 15:52:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2025-01-09 15:52:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:52:02,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:02,339 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:02,350 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:52:02,544 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:52:02,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 175043462, now seen corresponding path program 1 times [2025-01-09 15:52:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759774695] [2025-01-09 15:52:02,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:02,545 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:52:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:02,548 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:52:02,549 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:52:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:52:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:52:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:02,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:52:02,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:02,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:52:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:52:03,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:03,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:03,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759774695] [2025-01-09 15:52:03,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759774695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:52:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290114082] [2025-01-09 15:52:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:03,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:52:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:03,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:52:03,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:52:03,054 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:03,292 INFO L93 Difference]: Finished difference Result 328 states and 417 transitions. [2025-01-09 15:52:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:52:03,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:52:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:03,294 INFO L225 Difference]: With dead ends: 328 [2025-01-09 15:52:03,294 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 15:52:03,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:52:03,294 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 119 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:03,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1064 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:52:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 15:52:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 126. [2025-01-09 15:52:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 105 states have internal predecessors, (132), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2025-01-09 15:52:03,305 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 127 [2025-01-09 15:52:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:03,305 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2025-01-09 15:52:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2025-01-09 15:52:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:52:03,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:03,306 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:03,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-01-09 15:52:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:03,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:03,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1615792028, now seen corresponding path program 1 times [2025-01-09 15:52:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:03,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414106881] [2025-01-09 15:52:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:03,512 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:52:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:03,514 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:03,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:52:03,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:52:03,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:52:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:03,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:52:03,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:04,030 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 79 treesize of output 43 [2025-01-09 15:52:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:52:04,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:04,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414106881] [2025-01-09 15:52:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414106881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:04,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:04,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:52:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447930722] [2025-01-09 15:52:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:04,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:52:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:04,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:52:04,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:52:04,049 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:06,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:52:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:07,681 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2025-01-09 15:52:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:52:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2025-01-09 15:52:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:07,683 INFO L225 Difference]: With dead ends: 250 [2025-01-09 15:52:07,683 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:52:07,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:52:07,684 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 95 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:07,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 412 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 15:52:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:52:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-01-09 15:52:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 105 states have internal predecessors, (131), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2025-01-09 15:52:07,697 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 127 [2025-01-09 15:52:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2025-01-09 15:52:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2025-01-09 15:52:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:52:07,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:07,698 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:07,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:52:07,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:07,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:07,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 772875010, now seen corresponding path program 1 times [2025-01-09 15:52:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661853382] [2025-01-09 15:52:07,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:07,900 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:52:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:07,902 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:07,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:52:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:52:08,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:52:08,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:08,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:08,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:52:08,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:08,533 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:52:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-01-09 15:52:08,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:08,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661853382] [2025-01-09 15:52:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661853382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:08,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:52:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125048243] [2025-01-09 15:52:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:08,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:52:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:08,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:52:08,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:52:08,552 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:10,849 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2025-01-09 15:52:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:52:10,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-01-09 15:52:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:10,857 INFO L225 Difference]: With dead ends: 250 [2025-01-09 15:52:10,857 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:52:10,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 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:52:10,858 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 86 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:10,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 407 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 15:52:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:52:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-01-09 15:52:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 105 states have internal predecessors, (130), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2025-01-09 15:52:10,869 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 129 [2025-01-09 15:52:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:10,869 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2025-01-09 15:52:10,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2025-01-09 15:52:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:52:10,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:10,870 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:10,885 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 (13)] Ended with exit code 0 [2025-01-09 15:52:11,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:11,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:11,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash 453840476, now seen corresponding path program 1 times [2025-01-09 15:52:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314324690] [2025-01-09 15:52:11,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:11,072 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:52:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:11,074 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:52:11,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:52:11,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:52:11,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:11,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:11,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:52:11,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:11,764 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:52:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:52:11,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:11,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314324690] [2025-01-09 15:52:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314324690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:11,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:52:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020206074] [2025-01-09 15:52:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:52:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:52:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:52:11,781 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:14,801 INFO L93 Difference]: Finished difference Result 250 states and 314 transitions. [2025-01-09 15:52:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:52:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-01-09 15:52:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:14,810 INFO L225 Difference]: With dead ends: 250 [2025-01-09 15:52:14,810 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:52:14,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 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:52:14,810 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 78 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:14,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 403 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 15:52:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:52:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-01-09 15:52:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2025-01-09 15:52:14,821 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 131 [2025-01-09 15:52:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2025-01-09 15:52:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:52:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2025-01-09 15:52:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:14,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:14,823 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:14,839 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 (14)] Forceful destruction successful, exit code 0 [2025-01-09 15:52:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:15,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash -837884990, now seen corresponding path program 1 times [2025-01-09 15:52:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412580320] [2025-01-09 15:52:15,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:15,028 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:52:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:15,031 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:52:15,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:15,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:15,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:15,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:52:15,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:15,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:52:15,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 15:52:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:52:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:52:15,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:15,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412580320] [2025-01-09 15:52:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412580320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:15,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:52:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133524818] [2025-01-09 15:52:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:52:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:15,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:52:15,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:52:15,566 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:16,082 INFO L93 Difference]: Finished difference Result 324 states and 403 transitions. [2025-01-09 15:52:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:52:16,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-01-09 15:52:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:16,085 INFO L225 Difference]: With dead ends: 324 [2025-01-09 15:52:16,085 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 15:52:16,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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:52:16,085 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 122 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:16,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 466 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:52:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 15:52:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2025-01-09 15:52:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 105 states have internal predecessors, (128), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2025-01-09 15:52:16,096 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 133 [2025-01-09 15:52:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:16,096 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2025-01-09 15:52:16,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2025-01-09 15:52:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:16,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:16,097 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:16,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:52:16,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:16,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:16,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1651643972, now seen corresponding path program 1 times [2025-01-09 15:52:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384118341] [2025-01-09 15:52:16,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:16,301 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:16,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:52:16,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:16,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:16,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:52:16,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:16,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:52:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 15:52:16,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:52:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:52:16,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:16,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384118341] [2025-01-09 15:52:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384118341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:52:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426559879] [2025-01-09 15:52:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:52:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:16,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:52:16,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:52:16,954 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:17,440 INFO L93 Difference]: Finished difference Result 324 states and 401 transitions. [2025-01-09 15:52:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:52:17,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-01-09 15:52:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:17,442 INFO L225 Difference]: With dead ends: 324 [2025-01-09 15:52:17,442 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 15:52:17,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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:52:17,443 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:17,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:52:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 15:52:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2025-01-09 15:52:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 105 states have internal predecessors, (127), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:52:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2025-01-09 15:52:17,455 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 133 [2025-01-09 15:52:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:17,455 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2025-01-09 15:52:17,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2025-01-09 15:52:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:17,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:17,456 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:17,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 15:52:17,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:17,657 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:17,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1909809410, now seen corresponding path program 1 times [2025-01-09 15:52:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152227592] [2025-01-09 15:52:17,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:17,658 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:52:17,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:17,661 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:52:17,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:18,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:18,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:18,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:18,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:52:18,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:18,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:52:18,465 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 51 treesize of output 39 [2025-01-09 15:52:18,466 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 39 treesize of output 27 [2025-01-09 15:52:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 15:52:18,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:52:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:52:18,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152227592] [2025-01-09 15:52:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152227592] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:52:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:52:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-01-09 15:52:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197042242] [2025-01-09 15:52:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:52:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:18,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:52:18,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:52:18,614 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:18,795 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2025-01-09 15:52:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:52:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-01-09 15:52:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:18,797 INFO L225 Difference]: With dead ends: 201 [2025-01-09 15:52:18,797 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 15:52:18,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:52:18,797 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 101 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:18,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 802 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:52:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 15:52:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2025-01-09 15:52:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 159 states have (on average 1.1949685534591195) internal successors, (190), 160 states have internal predecessors, (190), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 15:52:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2025-01-09 15:52:18,816 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 133 [2025-01-09 15:52:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:18,816 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2025-01-09 15:52:18,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2025-01-09 15:52:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:18,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:18,817 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:18,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:52:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:52:19,021 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:19,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1911656452, now seen corresponding path program 1 times [2025-01-09 15:52:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221655490] [2025-01-09 15:52:19,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:19,022 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:52:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:19,025 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:52:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:52:19,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:19,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:19,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:19,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:19,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:52:19,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:19,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:52:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:52:19,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:52:19,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221655490] [2025-01-09 15:52:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221655490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:52:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:52:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:52:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939300507] [2025-01-09 15:52:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:52:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:52:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:19,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:52:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:52:19,495 INFO L87 Difference]: Start difference. First operand 198 states and 242 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:19,658 INFO L93 Difference]: Finished difference Result 340 states and 414 transitions. [2025-01-09 15:52:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:52:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-01-09 15:52:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:19,660 INFO L225 Difference]: With dead ends: 340 [2025-01-09 15:52:19,660 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 15:52:19,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:52:19,660 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 109 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:19,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 638 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:52:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 15:52:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-01-09 15:52:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 167 states have internal predecessors, (197), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:52:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2025-01-09 15:52:19,687 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 133 [2025-01-09 15:52:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:19,688 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2025-01-09 15:52:19,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:52:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2025-01-09 15:52:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:19,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:19,689 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:19,700 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 (18)] Forceful destruction successful, exit code 0 [2025-01-09 15:52:19,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:52:19,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -608303482, now seen corresponding path program 1 times [2025-01-09 15:52:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:19,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815144829] [2025-01-09 15:52:19,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:19,891 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:52:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:19,892 INFO L229 MonitoredProcess]: Starting monitored process 19 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:52:19,894 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 (19)] Waiting until timeout for monitored process [2025-01-09 15:52:20,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:20,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:52:20,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:21,080 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:21,226 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 125 treesize of output 89 [2025-01-09 15:52:21,230 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 135 treesize of output 75 [2025-01-09 15:52:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 15:52:21,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:52:21,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:52:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815144829] [2025-01-09 15:52:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815144829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:52:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [65455253] [2025-01-09 15:52:21,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:52:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:52:21,427 INFO L229 MonitoredProcess]: Starting monitored process 20 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:21,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-01-09 15:52:21,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:52:23,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:52:23,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:52:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:52:23,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:52:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:52:24,078 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:24,642 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:24,952 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 125 treesize of output 89 [2025-01-09 15:52:24,954 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 135 treesize of output 75 [2025-01-09 15:52:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:52:24,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:52:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [65455253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:52:25,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:52:25,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2025-01-09 15:52:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180231309] [2025-01-09 15:52:25,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:52:25,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:52:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:52:25,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:52:25,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:52:25,053 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand has 20 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 5 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) [2025-01-09 15:52:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:52:28,801 INFO L93 Difference]: Finished difference Result 668 states and 811 transitions. [2025-01-09 15:52:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:52:28,802 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 5 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) Word has length 133 [2025-01-09 15:52:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:52:28,804 INFO L225 Difference]: With dead ends: 668 [2025-01-09 15:52:28,804 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 15:52:28,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 15:52:28,805 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 802 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:52:28,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1362 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 15:52:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 15:52:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 393. [2025-01-09 15:52:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 317 states have (on average 1.1924290220820188) internal successors, (378), 321 states have internal predecessors, (378), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:52:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2025-01-09 15:52:28,862 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 133 [2025-01-09 15:52:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:52:28,863 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2025-01-09 15:52:28,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 5 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) [2025-01-09 15:52:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2025-01-09 15:52:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:52:28,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:52:28,864 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:52:28,877 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 (19)] Ended with exit code 0 [2025-01-09 15:52:29,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-01-09 15:52:29,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:52:29,264 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:52:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:52:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 71754888, now seen corresponding path program 1 times [2025-01-09 15:52:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:52:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450904779] [2025-01-09 15:52:29,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:52:29,265 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:52:29,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:52:29,268 INFO L229 MonitoredProcess]: Starting monitored process 21 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:52:29,270 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 (21)] Waiting until timeout for monitored process [2025-01-09 15:52:29,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.